./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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/mix051_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 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:31:22,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:31:22,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:31:22,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:31:22,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:31:22,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:31:22,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:31:22,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:31:22,993 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:31:22,993 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:31:22,994 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:31:22,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:31:22,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:31:22,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:31:22,998 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:31:22,999 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:31:22,999 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:31:22,999 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:31:23,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:31:23,000 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:31:23,004 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:31:23,005 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:31:23,005 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:31:23,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:31:23,005 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:31:23,006 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:31:23,006 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:31:23,006 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:31:23,006 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:31:23,007 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:31:23,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:31:23,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:31:23,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:31:23,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:31:23,010 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:31:23,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:31:23,011 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:31:23,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:31:23,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:31:23,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:31:23,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:31:23,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:31:23,013 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 -> 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 [2024-11-09 10:31:23,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:31:23,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:31:23,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:31:23,300 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:31:23,300 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:31:23,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2024-11-09 10:31:24,765 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:31:25,020 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:31:25,021 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2024-11-09 10:31:25,041 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/791fceb39/0e57dfd1bb9448b68bb761b82f024faa/FLAG88e9df1f7 [2024-11-09 10:31:25,054 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/791fceb39/0e57dfd1bb9448b68bb761b82f024faa [2024-11-09 10:31:25,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:31:25,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:31:25,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:31:25,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:31:25,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:31:25,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:31:25" (1/1) ... [2024-11-09 10:31:25,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c235e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:25, skipping insertion in model container [2024-11-09 10:31:25,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:31:25" (1/1) ... [2024-11-09 10:31:25,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:31:25,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:31:25,594 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:31:25,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:31:25,704 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:31:25,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:25 WrapperNode [2024-11-09 10:31:25,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:31:25,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:31:25,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:31:25,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:31:25,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:25" (1/1) ... [2024-11-09 10:31:25,744 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:25" (1/1) ... [2024-11-09 10:31:25,785 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2024-11-09 10:31:25,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:31:25,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:31:25,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:31:25,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:31:25,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:25" (1/1) ... [2024-11-09 10:31:25,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:25" (1/1) ... [2024-11-09 10:31:25,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:25" (1/1) ... [2024-11-09 10:31:25,836 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-09 10:31:25,838 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:25" (1/1) ... [2024-11-09 10:31:25,838 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:25" (1/1) ... [2024-11-09 10:31:25,848 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:25" (1/1) ... [2024-11-09 10:31:25,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:25" (1/1) ... [2024-11-09 10:31:25,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:25" (1/1) ... [2024-11-09 10:31:25,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:25" (1/1) ... [2024-11-09 10:31:25,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:31:25,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:31:25,868 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:31:25,868 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:31:25,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:25" (1/1) ... [2024-11-09 10:31:25,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:31:25,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:31:25,904 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-09 10:31:25,911 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-09 10:31:25,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:31:25,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:31:25,959 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-09 10:31:25,959 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-09 10:31:25,959 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-09 10:31:25,959 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-09 10:31:25,959 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-09 10:31:25,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-09 10:31:25,960 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-09 10:31:25,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-09 10:31:25,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:31:25,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:31:25,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:31:25,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:31:25,963 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:31:26,098 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:31:26,100 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:31:26,470 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:31:26,471 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:31:26,765 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:31:26,765 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:31:26,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:31:26 BoogieIcfgContainer [2024-11-09 10:31:26,766 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:31:26,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:31:26,770 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:31:26,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:31:26,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:31:25" (1/3) ... [2024-11-09 10:31:26,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9040552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:31:26, skipping insertion in model container [2024-11-09 10:31:26,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:25" (2/3) ... [2024-11-09 10:31:26,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9040552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:31:26, skipping insertion in model container [2024-11-09 10:31:26,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:31:26" (3/3) ... [2024-11-09 10:31:26,778 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2024-11-09 10:31:26,797 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:31:26,797 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 10:31:26,797 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:31:26,865 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:31:26,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 53 transitions, 122 flow [2024-11-09 10:31:26,944 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2024-11-09 10:31:26,945 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:31:26,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 2/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2024-11-09 10:31:26,953 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 53 transitions, 122 flow [2024-11-09 10:31:26,958 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 49 transitions, 110 flow [2024-11-09 10:31:26,971 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:31:26,980 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;@30641529, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:31:26,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-09 10:31:26,987 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:31:26,987 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-11-09 10:31:26,987 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:31:26,988 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:26,990 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:31:26,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:26,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:26,996 INFO L85 PathProgramCache]: Analyzing trace with hash -589101247, now seen corresponding path program 1 times [2024-11-09 10:31:27,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:27,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926942669] [2024-11-09 10:31:27,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:27,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:27,577 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-09 10:31:27,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:27,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926942669] [2024-11-09 10:31:27,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926942669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:27,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:27,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:31:27,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501603575] [2024-11-09 10:31:27,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:27,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:31:27,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:27,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:31:27,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:31:27,622 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2024-11-09 10:31:27,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:31:27,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:27,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2024-11-09 10:31:27,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:28,575 INFO L124 PetriNetUnfolderBase]: 2754/4553 cut-off events. [2024-11-09 10:31:28,576 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-09 10:31:28,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8492 conditions, 4553 events. 2754/4553 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 31890 event pairs, 492 based on Foata normal form. 216/4711 useless extension candidates. Maximal degree in co-relation 8480. Up to 3064 conditions per place. [2024-11-09 10:31:28,617 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 39 selfloop transitions, 2 changer transitions 2/63 dead transitions. [2024-11-09 10:31:28,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 230 flow [2024-11-09 10:31:28,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:31:28,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:31:28,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2024-11-09 10:31:28,629 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7547169811320755 [2024-11-09 10:31:28,631 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 120 transitions. [2024-11-09 10:31:28,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 230 flow [2024-11-09 10:31:28,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:31:28,639 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 100 flow [2024-11-09 10:31:28,641 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-11-09 10:31:28,645 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2024-11-09 10:31:28,646 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 100 flow [2024-11-09 10:31:28,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:31:28,646 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:28,646 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:28,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:31:28,647 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:28,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:28,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1317713306, now seen corresponding path program 1 times [2024-11-09 10:31:28,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:28,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635874568] [2024-11-09 10:31:28,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:28,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:28,767 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-09 10:31:28,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:28,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635874568] [2024-11-09 10:31:28,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635874568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:28,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:28,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:31:28,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391799986] [2024-11-09 10:31:28,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:28,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:31:28,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:28,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:31:28,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:31:28,772 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-11-09 10:31:28,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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-09 10:31:28,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:28,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-11-09 10:31:28,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:29,444 INFO L124 PetriNetUnfolderBase]: 2457/4061 cut-off events. [2024-11-09 10:31:29,444 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2024-11-09 10:31:29,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7833 conditions, 4061 events. 2457/4061 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 27530 event pairs, 2457 based on Foata normal form. 108/4000 useless extension candidates. Maximal degree in co-relation 7823. Up to 3424 conditions per place. [2024-11-09 10:31:29,528 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 22 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2024-11-09 10:31:29,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 43 transitions, 146 flow [2024-11-09 10:31:29,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:31:29,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:31:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-11-09 10:31:29,530 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5911949685534591 [2024-11-09 10:31:29,530 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 94 transitions. [2024-11-09 10:31:29,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 43 transitions, 146 flow [2024-11-09 10:31:29,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:31:29,532 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 94 flow [2024-11-09 10:31:29,534 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-11-09 10:31:29,536 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2024-11-09 10:31:29,536 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 94 flow [2024-11-09 10:31:29,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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-09 10:31:29,536 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:29,537 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:29,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:31:29,537 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:29,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:29,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1317711957, now seen corresponding path program 1 times [2024-11-09 10:31:29,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:29,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481020649] [2024-11-09 10:31:29,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:29,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:30,108 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-09 10:31:30,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:30,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481020649] [2024-11-09 10:31:30,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481020649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:30,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:30,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:31:30,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749596535] [2024-11-09 10:31:30,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:30,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:31:30,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:30,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:31:30,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:31:30,113 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-11-09 10:31:30,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 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-09 10:31:30,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:30,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-11-09 10:31:30,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:31,415 INFO L124 PetriNetUnfolderBase]: 4352/6805 cut-off events. [2024-11-09 10:31:31,415 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:31:31,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12984 conditions, 6805 events. 4352/6805 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 48737 event pairs, 875 based on Foata normal form. 0/6646 useless extension candidates. Maximal degree in co-relation 12978. Up to 3913 conditions per place. [2024-11-09 10:31:31,461 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 36 selfloop transitions, 3 changer transitions 48/104 dead transitions. [2024-11-09 10:31:31,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 104 transitions, 398 flow [2024-11-09 10:31:31,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:31:31,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:31:31,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 265 transitions. [2024-11-09 10:31:31,464 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-11-09 10:31:31,464 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 94 flow. Second operand 8 states and 265 transitions. [2024-11-09 10:31:31,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 104 transitions, 398 flow [2024-11-09 10:31:31,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 104 transitions, 397 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:31:31,471 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 126 flow [2024-11-09 10:31:31,471 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=126, PETRI_PLACES=64, PETRI_TRANSITIONS=43} [2024-11-09 10:31:31,472 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2024-11-09 10:31:31,472 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 126 flow [2024-11-09 10:31:31,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 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-09 10:31:31,472 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:31,473 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-09 10:31:31,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:31:31,473 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:31,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:31,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1260050401, now seen corresponding path program 1 times [2024-11-09 10:31:31,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:31,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55030448] [2024-11-09 10:31:31,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:31,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:31,711 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-09 10:31:31,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:31,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55030448] [2024-11-09 10:31:31,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55030448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:31,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:31,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:31:31,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024318397] [2024-11-09 10:31:31,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:31,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:31:31,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:31,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:31:31,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:31:31,720 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-09 10:31:31,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 43 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 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-09 10:31:31,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:31,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-09 10:31:31,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:33,347 INFO L124 PetriNetUnfolderBase]: 9378/13675 cut-off events. [2024-11-09 10:31:33,347 INFO L125 PetriNetUnfolderBase]: For 4215/4217 co-relation queries the response was YES. [2024-11-09 10:31:33,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30818 conditions, 13675 events. 9378/13675 cut-off events. For 4215/4217 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 88749 event pairs, 1001 based on Foata normal form. 384/13846 useless extension candidates. Maximal degree in co-relation 30806. Up to 8149 conditions per place. [2024-11-09 10:31:33,469 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 55 selfloop transitions, 6 changer transitions 0/75 dead transitions. [2024-11-09 10:31:33,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 75 transitions, 336 flow [2024-11-09 10:31:33,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:31:33,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:31:33,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2024-11-09 10:31:33,471 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6415094339622641 [2024-11-09 10:31:33,471 INFO L175 Difference]: Start difference. First operand has 64 places, 43 transitions, 126 flow. Second operand 4 states and 136 transitions. [2024-11-09 10:31:33,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 75 transitions, 336 flow [2024-11-09 10:31:33,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 75 transitions, 327 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-09 10:31:33,488 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 165 flow [2024-11-09 10:31:33,490 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2024-11-09 10:31:33,490 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2024-11-09 10:31:33,491 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 165 flow [2024-11-09 10:31:33,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 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-09 10:31:33,491 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:33,491 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] [2024-11-09 10:31:33,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:31:33,493 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:33,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:33,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1376895166, now seen corresponding path program 1 times [2024-11-09 10:31:33,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:33,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287486859] [2024-11-09 10:31:33,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:33,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:34,263 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-09 10:31:34,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:34,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287486859] [2024-11-09 10:31:34,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287486859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:34,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:34,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:31:34,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724571384] [2024-11-09 10:31:34,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:34,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:31:34,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:34,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:31:34,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:31:34,268 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-11-09 10:31:34,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 165 flow. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 0 states have call successors, (0), 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-09 10:31:34,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:34,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-11-09 10:31:34,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:35,720 INFO L124 PetriNetUnfolderBase]: 6436/10364 cut-off events. [2024-11-09 10:31:35,721 INFO L125 PetriNetUnfolderBase]: For 4682/4994 co-relation queries the response was YES. [2024-11-09 10:31:35,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24251 conditions, 10364 events. 6436/10364 cut-off events. For 4682/4994 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 78964 event pairs, 1405 based on Foata normal form. 205/9890 useless extension candidates. Maximal degree in co-relation 24238. Up to 6472 conditions per place. [2024-11-09 10:31:35,828 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 73 selfloop transitions, 15 changer transitions 0/110 dead transitions. [2024-11-09 10:31:35,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 110 transitions, 509 flow [2024-11-09 10:31:35,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:31:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:31:35,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 265 transitions. [2024-11-09 10:31:35,831 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-11-09 10:31:35,831 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 165 flow. Second operand 8 states and 265 transitions. [2024-11-09 10:31:35,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 110 transitions, 509 flow [2024-11-09 10:31:35,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 110 transitions, 499 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-09 10:31:35,836 INFO L231 Difference]: Finished difference. Result has 69 places, 59 transitions, 260 flow [2024-11-09 10:31:35,836 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=260, PETRI_PLACES=69, PETRI_TRANSITIONS=59} [2024-11-09 10:31:35,837 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 9 predicate places. [2024-11-09 10:31:35,837 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 59 transitions, 260 flow [2024-11-09 10:31:35,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 0 states have call successors, (0), 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-09 10:31:35,838 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:35,838 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] [2024-11-09 10:31:35,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:31:35,838 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:35,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:35,839 INFO L85 PathProgramCache]: Analyzing trace with hash 631646020, now seen corresponding path program 1 times [2024-11-09 10:31:35,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:35,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599172467] [2024-11-09 10:31:35,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:35,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:36,079 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-09 10:31:36,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:36,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599172467] [2024-11-09 10:31:36,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599172467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:36,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:36,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:31:36,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176179277] [2024-11-09 10:31:36,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:36,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:31:36,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:36,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:31:36,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:31:36,094 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-09 10:31:36,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 260 flow. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 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-09 10:31:36,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:36,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-09 10:31:36,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:37,641 INFO L124 PetriNetUnfolderBase]: 8553/12617 cut-off events. [2024-11-09 10:31:37,641 INFO L125 PetriNetUnfolderBase]: For 9883/9993 co-relation queries the response was YES. [2024-11-09 10:31:37,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34974 conditions, 12617 events. 8553/12617 cut-off events. For 9883/9993 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 80372 event pairs, 544 based on Foata normal form. 472/12816 useless extension candidates. Maximal degree in co-relation 34957. Up to 5977 conditions per place. [2024-11-09 10:31:37,793 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 84 selfloop transitions, 10 changer transitions 6/114 dead transitions. [2024-11-09 10:31:37,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 114 transitions, 682 flow [2024-11-09 10:31:37,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:31:37,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:31:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2024-11-09 10:31:37,795 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6566037735849056 [2024-11-09 10:31:37,795 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 260 flow. Second operand 5 states and 174 transitions. [2024-11-09 10:31:37,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 114 transitions, 682 flow [2024-11-09 10:31:37,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 114 transitions, 644 flow, removed 19 selfloop flow, removed 0 redundant places. [2024-11-09 10:31:37,839 INFO L231 Difference]: Finished difference. Result has 75 places, 58 transitions, 276 flow [2024-11-09 10:31:37,839 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=75, PETRI_TRANSITIONS=58} [2024-11-09 10:31:37,840 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 15 predicate places. [2024-11-09 10:31:37,840 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 58 transitions, 276 flow [2024-11-09 10:31:37,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 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-09 10:31:37,840 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:37,841 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-09 10:31:37,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:31:37,841 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:37,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:37,842 INFO L85 PathProgramCache]: Analyzing trace with hash -355854259, now seen corresponding path program 1 times [2024-11-09 10:31:37,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:37,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786306529] [2024-11-09 10:31:37,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:37,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:38,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:31:38,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:38,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786306529] [2024-11-09 10:31:38,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786306529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:38,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:38,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:31:38,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059891492] [2024-11-09 10:31:38,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:38,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:31:38,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:38,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:31:38,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:31:38,220 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-09 10:31:38,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 58 transitions, 276 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 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-09 10:31:38,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:38,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-09 10:31:38,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:39,294 INFO L124 PetriNetUnfolderBase]: 6017/8893 cut-off events. [2024-11-09 10:31:39,294 INFO L125 PetriNetUnfolderBase]: For 11079/11181 co-relation queries the response was YES. [2024-11-09 10:31:39,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27209 conditions, 8893 events. 6017/8893 cut-off events. For 11079/11181 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 53477 event pairs, 394 based on Foata normal form. 344/8965 useless extension candidates. Maximal degree in co-relation 27188. Up to 2656 conditions per place. [2024-11-09 10:31:39,344 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 93 selfloop transitions, 14 changer transitions 0/121 dead transitions. [2024-11-09 10:31:39,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 121 transitions, 728 flow [2024-11-09 10:31:39,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:31:39,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:31:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2024-11-09 10:31:39,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.660377358490566 [2024-11-09 10:31:39,346 INFO L175 Difference]: Start difference. First operand has 75 places, 58 transitions, 276 flow. Second operand 6 states and 210 transitions. [2024-11-09 10:31:39,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 121 transitions, 728 flow [2024-11-09 10:31:39,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 121 transitions, 706 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-09 10:31:39,355 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 335 flow [2024-11-09 10:31:39,356 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2024-11-09 10:31:39,356 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2024-11-09 10:31:39,356 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 335 flow [2024-11-09 10:31:39,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 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-09 10:31:39,357 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:39,357 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:39,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:31:39,357 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:39,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:39,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1305080659, now seen corresponding path program 1 times [2024-11-09 10:31:39,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:39,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347519149] [2024-11-09 10:31:39,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:39,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:39,692 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-09 10:31:39,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:39,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347519149] [2024-11-09 10:31:39,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347519149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:39,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:39,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:31:39,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088216347] [2024-11-09 10:31:39,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:39,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:31:39,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:39,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:31:39,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:31:39,703 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-09 10:31:39,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 335 flow. Second operand has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:31:39,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:39,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-09 10:31:39,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:40,515 INFO L124 PetriNetUnfolderBase]: 5109/7481 cut-off events. [2024-11-09 10:31:40,516 INFO L125 PetriNetUnfolderBase]: For 15525/15627 co-relation queries the response was YES. [2024-11-09 10:31:40,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24861 conditions, 7481 events. 5109/7481 cut-off events. For 15525/15627 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 44349 event pairs, 394 based on Foata normal form. 196/7405 useless extension candidates. Maximal degree in co-relation 24840. Up to 2656 conditions per place. [2024-11-09 10:31:40,592 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 86 selfloop transitions, 18 changer transitions 0/118 dead transitions. [2024-11-09 10:31:40,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 118 transitions, 730 flow [2024-11-09 10:31:40,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:31:40,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:31:40,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 226 transitions. [2024-11-09 10:31:40,594 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6091644204851752 [2024-11-09 10:31:40,594 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 335 flow. Second operand 7 states and 226 transitions. [2024-11-09 10:31:40,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 118 transitions, 730 flow [2024-11-09 10:31:40,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 118 transitions, 673 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-11-09 10:31:40,649 INFO L231 Difference]: Finished difference. Result has 76 places, 63 transitions, 349 flow [2024-11-09 10:31:40,649 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=349, PETRI_PLACES=76, PETRI_TRANSITIONS=63} [2024-11-09 10:31:40,652 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 16 predicate places. [2024-11-09 10:31:40,653 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 63 transitions, 349 flow [2024-11-09 10:31:40,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:31:40,654 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:40,654 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:40,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:31:40,654 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:40,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:40,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1215573617, now seen corresponding path program 1 times [2024-11-09 10:31:40,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:40,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956910963] [2024-11-09 10:31:40,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:40,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:41,009 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-09 10:31:41,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:41,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956910963] [2024-11-09 10:31:41,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956910963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:41,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:41,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:31:41,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96712034] [2024-11-09 10:31:41,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:41,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:31:41,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:41,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:31:41,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:31:41,018 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-11-09 10:31:41,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 63 transitions, 349 flow. Second operand has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 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-09 10:31:41,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:41,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-11-09 10:31:41,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:41,874 INFO L124 PetriNetUnfolderBase]: 5267/9065 cut-off events. [2024-11-09 10:31:41,875 INFO L125 PetriNetUnfolderBase]: For 17735/21445 co-relation queries the response was YES. [2024-11-09 10:31:41,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26193 conditions, 9065 events. 5267/9065 cut-off events. For 17735/21445 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 69921 event pairs, 1403 based on Foata normal form. 193/8368 useless extension candidates. Maximal degree in co-relation 26173. Up to 3527 conditions per place. [2024-11-09 10:31:41,956 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 43 selfloop transitions, 1 changer transitions 28/105 dead transitions. [2024-11-09 10:31:41,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 105 transitions, 629 flow [2024-11-09 10:31:41,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:31:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:31:41,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2024-11-09 10:31:41,958 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5943396226415094 [2024-11-09 10:31:41,958 INFO L175 Difference]: Start difference. First operand has 76 places, 63 transitions, 349 flow. Second operand 6 states and 189 transitions. [2024-11-09 10:31:41,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 105 transitions, 629 flow [2024-11-09 10:31:42,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 105 transitions, 582 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-11-09 10:31:42,096 INFO L231 Difference]: Finished difference. Result has 81 places, 63 transitions, 313 flow [2024-11-09 10:31:42,096 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=313, PETRI_PLACES=81, PETRI_TRANSITIONS=63} [2024-11-09 10:31:42,097 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 21 predicate places. [2024-11-09 10:31:42,097 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 63 transitions, 313 flow [2024-11-09 10:31:42,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 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-09 10:31:42,097 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:42,097 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:42,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:31:42,098 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:42,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:42,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1487766087, now seen corresponding path program 2 times [2024-11-09 10:31:42,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:42,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593345349] [2024-11-09 10:31:42,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:42,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:42,393 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-09 10:31:42,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:42,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593345349] [2024-11-09 10:31:42,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593345349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:42,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:42,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:31:42,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980688154] [2024-11-09 10:31:42,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:42,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:31:42,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:42,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:31:42,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:31:42,406 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-11-09 10:31:42,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 63 transitions, 313 flow. Second operand has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 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-09 10:31:42,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:42,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-11-09 10:31:42,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:43,294 INFO L124 PetriNetUnfolderBase]: 5986/10239 cut-off events. [2024-11-09 10:31:43,294 INFO L125 PetriNetUnfolderBase]: For 13892/16057 co-relation queries the response was YES. [2024-11-09 10:31:43,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27539 conditions, 10239 events. 5986/10239 cut-off events. For 13892/16057 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 80695 event pairs, 1644 based on Foata normal form. 241/9321 useless extension candidates. Maximal degree in co-relation 27516. Up to 3669 conditions per place. [2024-11-09 10:31:43,361 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 35 selfloop transitions, 1 changer transitions 34/103 dead transitions. [2024-11-09 10:31:43,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 103 transitions, 594 flow [2024-11-09 10:31:43,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:31:43,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:31:43,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2024-11-09 10:31:43,363 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5754716981132075 [2024-11-09 10:31:43,363 INFO L175 Difference]: Start difference. First operand has 81 places, 63 transitions, 313 flow. Second operand 6 states and 183 transitions. [2024-11-09 10:31:43,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 103 transitions, 594 flow [2024-11-09 10:31:43,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 103 transitions, 583 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 10:31:43,509 INFO L231 Difference]: Finished difference. Result has 83 places, 63 transitions, 317 flow [2024-11-09 10:31:43,510 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=83, PETRI_TRANSITIONS=63} [2024-11-09 10:31:43,510 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 23 predicate places. [2024-11-09 10:31:43,511 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 63 transitions, 317 flow [2024-11-09 10:31:43,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 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-09 10:31:43,511 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:43,511 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:43,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:31:43,512 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:43,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:43,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1379918383, now seen corresponding path program 3 times [2024-11-09 10:31:43,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:43,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871368351] [2024-11-09 10:31:43,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:43,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:43,817 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-09 10:31:43,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:43,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871368351] [2024-11-09 10:31:43,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871368351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:43,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:43,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:31:43,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173627312] [2024-11-09 10:31:43,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:43,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:31:43,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:43,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:31:43,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:31:43,825 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-11-09 10:31:43,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 63 transitions, 317 flow. Second operand has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 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-09 10:31:43,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:43,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-11-09 10:31:43,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:44,789 INFO L124 PetriNetUnfolderBase]: 5979/10616 cut-off events. [2024-11-09 10:31:44,790 INFO L125 PetriNetUnfolderBase]: For 13374/15041 co-relation queries the response was YES. [2024-11-09 10:31:44,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28653 conditions, 10616 events. 5979/10616 cut-off events. For 13374/15041 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 86112 event pairs, 1660 based on Foata normal form. 171/9681 useless extension candidates. Maximal degree in co-relation 28629. Up to 4076 conditions per place. [2024-11-09 10:31:44,886 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 29 selfloop transitions, 1 changer transitions 39/101 dead transitions. [2024-11-09 10:31:44,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 101 transitions, 577 flow [2024-11-09 10:31:44,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:31:44,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:31:44,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2024-11-09 10:31:44,888 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5849056603773585 [2024-11-09 10:31:44,889 INFO L175 Difference]: Start difference. First operand has 83 places, 63 transitions, 317 flow. Second operand 6 states and 186 transitions. [2024-11-09 10:31:44,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 101 transitions, 577 flow [2024-11-09 10:31:45,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 101 transitions, 566 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 10:31:45,045 INFO L231 Difference]: Finished difference. Result has 85 places, 57 transitions, 290 flow [2024-11-09 10:31:45,045 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=290, PETRI_PLACES=85, PETRI_TRANSITIONS=57} [2024-11-09 10:31:45,046 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 25 predicate places. [2024-11-09 10:31:45,046 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 57 transitions, 290 flow [2024-11-09 10:31:45,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 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-09 10:31:45,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:45,046 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:45,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:31:45,046 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:45,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:45,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1732254501, now seen corresponding path program 4 times [2024-11-09 10:31:45,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:45,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615843030] [2024-11-09 10:31:45,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:45,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:47,404 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-09 10:31:47,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:31:47,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615843030] [2024-11-09 10:31:47,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615843030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:47,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:47,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 10:31:47,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108061813] [2024-11-09 10:31:47,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:47,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 10:31:47,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:31:47,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 10:31:47,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:31:47,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-09 10:31:47,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 57 transitions, 290 flow. Second operand has 11 states, 11 states have (on average 21.09090909090909) internal successors, (232), 11 states have internal predecessors, (232), 0 states have call successors, (0), 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-09 10:31:47,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:47,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-09 10:31:47,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:48,493 INFO L124 PetriNetUnfolderBase]: 4788/8600 cut-off events. [2024-11-09 10:31:48,494 INFO L125 PetriNetUnfolderBase]: For 10386/10702 co-relation queries the response was YES. [2024-11-09 10:31:48,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24067 conditions, 8600 events. 4788/8600 cut-off events. For 10386/10702 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 67227 event pairs, 1704 based on Foata normal form. 70/7940 useless extension candidates. Maximal degree in co-relation 24042. Up to 3276 conditions per place. [2024-11-09 10:31:48,562 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 43 selfloop transitions, 4 changer transitions 18/95 dead transitions. [2024-11-09 10:31:48,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 95 transitions, 544 flow [2024-11-09 10:31:48,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:31:48,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:31:48,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 199 transitions. [2024-11-09 10:31:48,564 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5363881401617251 [2024-11-09 10:31:48,564 INFO L175 Difference]: Start difference. First operand has 85 places, 57 transitions, 290 flow. Second operand 7 states and 199 transitions. [2024-11-09 10:31:48,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 95 transitions, 544 flow [2024-11-09 10:31:48,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 95 transitions, 529 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-11-09 10:31:48,685 INFO L231 Difference]: Finished difference. Result has 85 places, 58 transitions, 304 flow [2024-11-09 10:31:48,685 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=304, PETRI_PLACES=85, PETRI_TRANSITIONS=58} [2024-11-09 10:31:48,687 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 25 predicate places. [2024-11-09 10:31:48,687 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 58 transitions, 304 flow [2024-11-09 10:31:48,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.09090909090909) internal successors, (232), 11 states have internal predecessors, (232), 0 states have call successors, (0), 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-09 10:31:48,687 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:48,687 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:48,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:31:48,688 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:48,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:48,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1772048449, now seen corresponding path program 5 times [2024-11-09 10:31:48,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:31:48,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642997070] [2024-11-09 10:31:48,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:48,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:31:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:31:48,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:31:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:31:48,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:31:48,892 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:31:48,893 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-09 10:31:48,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-09 10:31:48,895 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-09 10:31:48,895 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-09 10:31:48,895 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-09 10:31:48,895 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-09 10:31:48,895 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-09 10:31:48,896 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-09 10:31:48,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:31:48,896 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:48,997 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:31:48,997 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:31:49,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:31:49 BasicIcfg [2024-11-09 10:31:49,003 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:31:49,004 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:31:49,004 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:31:49,005 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:31:49,005 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:31:26" (3/4) ... [2024-11-09 10:31:49,007 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:31:49,008 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:31:49,009 INFO L158 Benchmark]: Toolchain (without parser) took 23951.38ms. Allocated memory was 182.5MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 123.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-09 10:31:49,009 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 182.5MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:31:49,009 INFO L158 Benchmark]: CACSL2BoogieTranslator took 646.39ms. Allocated memory is still 182.5MB. Free memory was 123.2MB in the beginning and 96.3MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-09 10:31:49,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.96ms. Allocated memory is still 182.5MB. Free memory was 96.3MB in the beginning and 93.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:31:49,010 INFO L158 Benchmark]: Boogie Preprocessor took 79.15ms. Allocated memory is still 182.5MB. Free memory was 93.5MB in the beginning and 89.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:31:49,010 INFO L158 Benchmark]: RCFGBuilder took 898.48ms. Allocated memory was 182.5MB in the beginning and 243.3MB in the end (delta: 60.8MB). Free memory was 89.7MB in the beginning and 177.4MB in the end (delta: -87.8MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2024-11-09 10:31:49,010 INFO L158 Benchmark]: TraceAbstraction took 22235.57ms. Allocated memory was 243.3MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 176.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-09 10:31:49,010 INFO L158 Benchmark]: Witness Printer took 3.97ms. Allocated memory is still 2.5GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:31:49,011 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.19ms. Allocated memory is still 182.5MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 646.39ms. Allocated memory is still 182.5MB. Free memory was 123.2MB in the beginning and 96.3MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.96ms. Allocated memory is still 182.5MB. Free memory was 96.3MB in the beginning and 93.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.15ms. Allocated memory is still 182.5MB. Free memory was 93.5MB in the beginning and 89.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 898.48ms. Allocated memory was 182.5MB in the beginning and 243.3MB in the end (delta: 60.8MB). Free memory was 89.7MB in the beginning and 177.4MB in the end (delta: -87.8MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. * TraceAbstraction took 22235.57ms. Allocated memory was 243.3MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 176.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 3.97ms. Allocated memory is still 2.5GB. Free memory is still 1.2GB. 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1377; [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L850] 0 pthread_t t1378; [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-2, t1378=-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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L852] 0 pthread_t t1379; [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L854] 0 pthread_t t1380; [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L800] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L820] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L756] 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) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 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 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L806] 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) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 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 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L826] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L786] 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) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 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 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 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) [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 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 [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] 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) [L873] 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)) [L874] 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)) [L875] 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)) [L876] 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)) [L877] 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)) [L878] 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)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=1, weak$$choice0=1, weak$$choice2=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L883] 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}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=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", "mix051_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=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: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 849]: 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: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 8 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: 22.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 15.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 734 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 708 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1689 IncrementalHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 17 mSDtfsCounter, 1689 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=8, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 347 NumberOfCodeBlocks, 347 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 1945 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 10:31:49,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix051_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 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:31:51,672 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:31:51,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:31:51,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:31:51,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:31:51,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:31:51,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:31:51,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:31:51,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:31:51,806 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:31:51,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:31:51,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:31:51,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:31:51,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:31:51,811 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:31:51,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:31:51,812 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:31:51,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:31:51,813 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:31:51,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:31:51,815 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:31:51,815 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:31:51,815 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:31:51,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:31:51,816 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:31:51,816 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:31:51,816 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:31:51,816 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:31:51,817 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:31:51,817 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:31:51,817 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:31:51,817 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:31:51,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:31:51,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:31:51,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:31:51,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:31:51,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:31:51,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:31:51,821 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:31:51,822 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:31:51,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:31:51,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:31:51,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:31:51,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:31:51,823 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 -> 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 [2024-11-09 10:31:52,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:31:52,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:31:52,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:31:52,186 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:31:52,186 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:31:52,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2024-11-09 10:31:53,792 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:31:54,101 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:31:54,101 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2024-11-09 10:31:54,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b63dc33/f1517619c9a246ce868e358c2cd7031f/FLAG8cde3af4c [2024-11-09 10:31:54,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b63dc33/f1517619c9a246ce868e358c2cd7031f [2024-11-09 10:31:54,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:31:54,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:31:54,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:31:54,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:31:54,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:31:54,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:31:54" (1/1) ... [2024-11-09 10:31:54,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd135ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:54, skipping insertion in model container [2024-11-09 10:31:54,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:31:54" (1/1) ... [2024-11-09 10:31:54,421 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:31:54,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:31:54,882 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:31:54,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:31:55,004 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:31:55,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:55 WrapperNode [2024-11-09 10:31:55,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:31:55,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:31:55,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:31:55,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:31:55,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:55" (1/1) ... [2024-11-09 10:31:55,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:55" (1/1) ... [2024-11-09 10:31:55,078 INFO L138 Inliner]: procedures = 177, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2024-11-09 10:31:55,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:31:55,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:31:55,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:31:55,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:31:55,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:55" (1/1) ... [2024-11-09 10:31:55,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:55" (1/1) ... [2024-11-09 10:31:55,104 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:55" (1/1) ... [2024-11-09 10:31:55,129 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-09 10:31:55,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:55" (1/1) ... [2024-11-09 10:31:55,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:55" (1/1) ... [2024-11-09 10:31:55,138 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:55" (1/1) ... [2024-11-09 10:31:55,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:55" (1/1) ... [2024-11-09 10:31:55,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:55" (1/1) ... [2024-11-09 10:31:55,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:55" (1/1) ... [2024-11-09 10:31:55,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:31:55,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:31:55,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:31:55,157 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:31:55,162 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:55" (1/1) ... [2024-11-09 10:31:55,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:31:55,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:31:55,194 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-09 10:31:55,197 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-09 10:31:55,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:31:55,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:31:55,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:31:55,233 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-09 10:31:55,233 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-09 10:31:55,233 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-09 10:31:55,234 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-09 10:31:55,234 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-09 10:31:55,234 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-09 10:31:55,234 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-09 10:31:55,234 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-09 10:31:55,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:31:55,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:31:55,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:31:55,236 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:31:55,383 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:31:55,385 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:31:55,786 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:31:55,787 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:31:56,067 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:31:56,068 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:31:56,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:31:56 BoogieIcfgContainer [2024-11-09 10:31:56,069 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:31:56,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:31:56,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:31:56,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:31:56,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:31:54" (1/3) ... [2024-11-09 10:31:56,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a861b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:31:56, skipping insertion in model container [2024-11-09 10:31:56,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:55" (2/3) ... [2024-11-09 10:31:56,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a861b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:31:56, skipping insertion in model container [2024-11-09 10:31:56,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:31:56" (3/3) ... [2024-11-09 10:31:56,079 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2024-11-09 10:31:56,099 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:31:56,099 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 10:31:56,100 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:31:56,173 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:31:56,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 53 transitions, 122 flow [2024-11-09 10:31:56,245 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2024-11-09 10:31:56,246 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:31:56,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 2/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2024-11-09 10:31:56,252 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 53 transitions, 122 flow [2024-11-09 10:31:56,256 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 49 transitions, 110 flow [2024-11-09 10:31:56,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:31:56,276 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;@37886503, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:31:56,276 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-09 10:31:56,284 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:31:56,284 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-11-09 10:31:56,285 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:31:56,285 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:56,285 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:31:56,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:56,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:56,292 INFO L85 PathProgramCache]: Analyzing trace with hash -529934335, now seen corresponding path program 1 times [2024-11-09 10:31:56,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:31:56,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854038035] [2024-11-09 10:31:56,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:56,309 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-09 10:31:56,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:31:56,312 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-09 10:31:56,314 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-09 10:31:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:56,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:31:56,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:31:56,475 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-09 10:31:56,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:31:56,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:31:56,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854038035] [2024-11-09 10:31:56,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854038035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:56,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:56,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:31:56,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245650397] [2024-11-09 10:31:56,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:56,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:31:56,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:31:56,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:31:56,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:31:56,535 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2024-11-09 10:31:56,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:31:56,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:56,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2024-11-09 10:31:56,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:57,454 INFO L124 PetriNetUnfolderBase]: 2754/4553 cut-off events. [2024-11-09 10:31:57,454 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-09 10:31:57,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8492 conditions, 4553 events. 2754/4553 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 31890 event pairs, 492 based on Foata normal form. 216/4711 useless extension candidates. Maximal degree in co-relation 8480. Up to 3064 conditions per place. [2024-11-09 10:31:57,540 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 39 selfloop transitions, 2 changer transitions 2/63 dead transitions. [2024-11-09 10:31:57,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 230 flow [2024-11-09 10:31:57,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:31:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:31:57,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2024-11-09 10:31:57,552 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7547169811320755 [2024-11-09 10:31:57,554 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 120 transitions. [2024-11-09 10:31:57,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 230 flow [2024-11-09 10:31:57,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:31:57,561 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 100 flow [2024-11-09 10:31:57,563 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-11-09 10:31:57,566 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2024-11-09 10:31:57,566 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 100 flow [2024-11-09 10:31:57,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:31:57,567 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:57,567 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:31:57,574 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-09 10:31:57,769 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-09 10:31:57,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:57,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:57,771 INFO L85 PathProgramCache]: Analyzing trace with hash -238860184, now seen corresponding path program 1 times [2024-11-09 10:31:57,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:31:57,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058477583] [2024-11-09 10:31:57,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:57,774 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-09 10:31:57,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:31:57,777 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-09 10:31:57,778 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-09 10:31:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:57,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:31:57,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:31:57,964 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-09 10:31:57,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:31:57,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:31:57,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058477583] [2024-11-09 10:31:57,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058477583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:31:57,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:31:57,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:31:57,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949067080] [2024-11-09 10:31:57,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:31:57,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:31:57,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:31:57,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:31:57,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:31:57,981 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-09 10:31:57,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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-09 10:31:57,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:31:57,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-09 10:31:57,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:31:59,585 INFO L124 PetriNetUnfolderBase]: 8909/13395 cut-off events. [2024-11-09 10:31:59,585 INFO L125 PetriNetUnfolderBase]: For 624/624 co-relation queries the response was YES. [2024-11-09 10:31:59,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26383 conditions, 13395 events. 8909/13395 cut-off events. For 624/624 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 91357 event pairs, 869 based on Foata normal form. 320/13542 useless extension candidates. Maximal degree in co-relation 26373. Up to 8233 conditions per place. [2024-11-09 10:31:59,671 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 52 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2024-11-09 10:31:59,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 74 transitions, 288 flow [2024-11-09 10:31:59,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:31:59,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:31:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2024-11-09 10:31:59,673 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6462264150943396 [2024-11-09 10:31:59,673 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 4 states and 137 transitions. [2024-11-09 10:31:59,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 74 transitions, 288 flow [2024-11-09 10:31:59,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 74 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:31:59,678 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 138 flow [2024-11-09 10:31:59,678 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2024-11-09 10:31:59,679 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places. [2024-11-09 10:31:59,679 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 138 flow [2024-11-09 10:31:59,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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-09 10:31:59,679 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:31:59,679 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] [2024-11-09 10:31:59,686 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-09 10:31:59,880 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-09 10:31:59,880 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:31:59,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:31:59,881 INFO L85 PathProgramCache]: Analyzing trace with hash 137743549, now seen corresponding path program 1 times [2024-11-09 10:31:59,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:31:59,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512986291] [2024-11-09 10:31:59,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:31:59,882 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-09 10:31:59,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:31:59,884 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-09 10:31:59,885 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-09 10:31:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:31:59,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:31:59,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:00,098 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-09 10:32:00,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:00,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:00,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512986291] [2024-11-09 10:32:00,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512986291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:00,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:00,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:32:00,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228457785] [2024-11-09 10:32:00,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:00,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:32:00,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:00,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:32:00,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:32:00,110 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-09 10:32:00,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 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-09 10:32:00,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:00,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-09 10:32:00,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:01,442 INFO L124 PetriNetUnfolderBase]: 6745/10239 cut-off events. [2024-11-09 10:32:01,442 INFO L125 PetriNetUnfolderBase]: For 2356/2356 co-relation queries the response was YES. [2024-11-09 10:32:01,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22921 conditions, 10239 events. 6745/10239 cut-off events. For 2356/2356 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 67122 event pairs, 369 based on Foata normal form. 296/10386 useless extension candidates. Maximal degree in co-relation 22909. Up to 5461 conditions per place. [2024-11-09 10:32:01,535 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 66 selfloop transitions, 10 changer transitions 1/92 dead transitions. [2024-11-09 10:32:01,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 92 transitions, 409 flow [2024-11-09 10:32:01,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:32:01,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:32:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2024-11-09 10:32:01,538 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6566037735849056 [2024-11-09 10:32:01,538 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 138 flow. Second operand 5 states and 174 transitions. [2024-11-09 10:32:01,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 92 transitions, 409 flow [2024-11-09 10:32:01,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 92 transitions, 398 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 10:32:01,545 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 190 flow [2024-11-09 10:32:01,545 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=190, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2024-11-09 10:32:01,546 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2024-11-09 10:32:01,547 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 190 flow [2024-11-09 10:32:01,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 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-09 10:32:01,547 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:01,548 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-09 10:32:01,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 10:32:01,748 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-09 10:32:01,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:32:01,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:01,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1345148874, now seen corresponding path program 1 times [2024-11-09 10:32:01,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:01,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011246424] [2024-11-09 10:32:01,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:32:01,750 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-09 10:32:01,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:01,778 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-09 10:32:01,786 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-09 10:32:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:32:01,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:32:01,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:02,086 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-09 10:32:02,088 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:02,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:02,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011246424] [2024-11-09 10:32:02,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011246424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:02,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:02,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:32:02,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295431986] [2024-11-09 10:32:02,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:02,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:32:02,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:02,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:32:02,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:32:02,101 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-09 10:32:02,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 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-09 10:32:02,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:02,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-09 10:32:02,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:02,829 INFO L124 PetriNetUnfolderBase]: 4037/6123 cut-off events. [2024-11-09 10:32:02,829 INFO L125 PetriNetUnfolderBase]: For 4217/4217 co-relation queries the response was YES. [2024-11-09 10:32:02,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15375 conditions, 6123 events. 4037/6123 cut-off events. For 4217/4217 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 35613 event pairs, 221 based on Foata normal form. 208/6199 useless extension candidates. Maximal degree in co-relation 15361. Up to 2101 conditions per place. [2024-11-09 10:32:02,870 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 78 selfloop transitions, 14 changer transitions 1/108 dead transitions. [2024-11-09 10:32:02,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 108 transitions, 536 flow [2024-11-09 10:32:02,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:32:02,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:32:02,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2024-11-09 10:32:02,873 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6572327044025157 [2024-11-09 10:32:02,873 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 190 flow. Second operand 6 states and 209 transitions. [2024-11-09 10:32:02,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 108 transitions, 536 flow [2024-11-09 10:32:02,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 108 transitions, 506 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 10:32:02,891 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 240 flow [2024-11-09 10:32:02,891 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=240, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2024-11-09 10:32:02,892 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2024-11-09 10:32:02,892 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 240 flow [2024-11-09 10:32:02,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 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-09 10:32:02,892 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:02,893 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:32:02,898 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-09 10:32:03,093 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-09 10:32:03,094 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:32:03,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:03,094 INFO L85 PathProgramCache]: Analyzing trace with hash -2023322776, now seen corresponding path program 1 times [2024-11-09 10:32:03,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:03,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653726003] [2024-11-09 10:32:03,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:32:03,095 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-09 10:32:03,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:03,098 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-09 10:32:03,101 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-09 10:32:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:32:03,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:32:03,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:03,291 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-09 10:32:03,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:03,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:03,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653726003] [2024-11-09 10:32:03,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1653726003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:03,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:03,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:32:03,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760345361] [2024-11-09 10:32:03,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:03,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:32:03,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:03,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:32:03,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:32:03,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-11-09 10:32:03,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:32:03,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:03,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-11-09 10:32:03,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:03,973 INFO L124 PetriNetUnfolderBase]: 2489/3663 cut-off events. [2024-11-09 10:32:03,973 INFO L125 PetriNetUnfolderBase]: For 4281/4281 co-relation queries the response was YES. [2024-11-09 10:32:03,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10216 conditions, 3663 events. 2489/3663 cut-off events. For 4281/4281 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 18680 event pairs, 173 based on Foata normal form. 88/3619 useless extension candidates. Maximal degree in co-relation 10201. Up to 1088 conditions per place. [2024-11-09 10:32:03,995 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 70 selfloop transitions, 18 changer transitions 1/104 dead transitions. [2024-11-09 10:32:03,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 104 transitions, 530 flow [2024-11-09 10:32:03,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:32:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:32:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 224 transitions. [2024-11-09 10:32:03,997 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6037735849056604 [2024-11-09 10:32:03,997 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 240 flow. Second operand 7 states and 224 transitions. [2024-11-09 10:32:03,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 104 transitions, 530 flow [2024-11-09 10:32:04,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 104 transitions, 484 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-09 10:32:04,025 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 250 flow [2024-11-09 10:32:04,026 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=250, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2024-11-09 10:32:04,026 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2024-11-09 10:32:04,027 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 250 flow [2024-11-09 10:32:04,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:32:04,027 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:04,027 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:32:04,032 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-09 10:32:04,227 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-09 10:32:04,228 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:32:04,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:04,229 INFO L85 PathProgramCache]: Analyzing trace with hash -534059060, now seen corresponding path program 1 times [2024-11-09 10:32:04,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:04,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75646835] [2024-11-09 10:32:04,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:32:04,230 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-09 10:32:04,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:04,231 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-09 10:32:04,232 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-09 10:32:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:32:04,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:32:04,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:04,396 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-09 10:32:04,396 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:04,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:04,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75646835] [2024-11-09 10:32:04,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75646835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:04,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:04,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:32:04,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544164384] [2024-11-09 10:32:04,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:04,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:32:04,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:04,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:32:04,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:32:04,399 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-11-09 10:32:04,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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-09 10:32:04,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:04,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-11-09 10:32:04,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:04,602 INFO L124 PetriNetUnfolderBase]: 1181/2101 cut-off events. [2024-11-09 10:32:04,602 INFO L125 PetriNetUnfolderBase]: For 688/738 co-relation queries the response was YES. [2024-11-09 10:32:04,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4582 conditions, 2101 events. 1181/2101 cut-off events. For 688/738 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12785 event pairs, 1115 based on Foata normal form. 16/1868 useless extension candidates. Maximal degree in co-relation 4566. Up to 1680 conditions per place. [2024-11-09 10:32:04,617 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 22 selfloop transitions, 1 changer transitions 1/55 dead transitions. [2024-11-09 10:32:04,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 55 transitions, 296 flow [2024-11-09 10:32:04,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:32:04,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:32:04,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-11-09 10:32:04,619 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5911949685534591 [2024-11-09 10:32:04,619 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 250 flow. Second operand 3 states and 94 transitions. [2024-11-09 10:32:04,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 55 transitions, 296 flow [2024-11-09 10:32:04,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 55 transitions, 200 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-11-09 10:32:04,623 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 152 flow [2024-11-09 10:32:04,624 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2024-11-09 10:32:04,624 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2024-11-09 10:32:04,624 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 152 flow [2024-11-09 10:32:04,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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-09 10:32:04,625 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:04,625 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:32:04,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-09 10:32:04,829 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-09 10:32:04,829 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:32:04,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:04,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1758050391, now seen corresponding path program 1 times [2024-11-09 10:32:04,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:04,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85691527] [2024-11-09 10:32:04,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:32:04,831 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-09 10:32:04,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:04,834 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-09 10:32:04,835 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-09 10:32:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:32:04,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:32:04,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:05,069 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-09 10:32:05,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:05,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:05,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85691527] [2024-11-09 10:32:05,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85691527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:05,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:05,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:32:05,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435465582] [2024-11-09 10:32:05,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:05,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:32:05,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:05,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:32:05,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:32:05,079 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-11-09 10:32:05,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 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-09 10:32:05,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:05,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-11-09 10:32:05,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:05,623 INFO L124 PetriNetUnfolderBase]: 2915/4767 cut-off events. [2024-11-09 10:32:05,623 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:32:05,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9432 conditions, 4767 events. 2915/4767 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 30533 event pairs, 554 based on Foata normal form. 16/4506 useless extension candidates. Maximal degree in co-relation 9425. Up to 2088 conditions per place. [2024-11-09 10:32:05,649 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 48 selfloop transitions, 2 changer transitions 12/91 dead transitions. [2024-11-09 10:32:05,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 91 transitions, 356 flow [2024-11-09 10:32:05,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:32:05,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:32:05,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2024-11-09 10:32:05,651 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6132075471698113 [2024-11-09 10:32:05,652 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 152 flow. Second operand 6 states and 195 transitions. [2024-11-09 10:32:05,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 91 transitions, 356 flow [2024-11-09 10:32:05,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 91 transitions, 355 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:32:05,654 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 168 flow [2024-11-09 10:32:05,654 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=168, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2024-11-09 10:32:05,656 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 6 predicate places. [2024-11-09 10:32:05,656 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 168 flow [2024-11-09 10:32:05,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 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-09 10:32:05,656 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:05,657 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:32:05,663 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-09 10:32:05,858 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-09 10:32:05,858 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:32:05,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:05,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2013505003, now seen corresponding path program 2 times [2024-11-09 10:32:05,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:05,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431651271] [2024-11-09 10:32:05,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:32:05,860 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-09 10:32:05,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:05,861 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-09 10:32:05,862 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-09 10:32:05,963 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 10:32:05,963 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:32:05,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 10:32:05,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:06,794 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-09 10:32:06,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:06,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:06,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431651271] [2024-11-09 10:32:06,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431651271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:06,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:06,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 10:32:06,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728844766] [2024-11-09 10:32:06,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:06,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 10:32:06,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:06,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 10:32:06,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:32:06,808 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-11-09 10:32:06,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 168 flow. Second operand has 12 states, 12 states have (on average 24.666666666666668) internal successors, (296), 12 states have internal predecessors, (296), 0 states have call successors, (0), 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-09 10:32:06,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:06,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-11-09 10:32:06,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:07,798 INFO L124 PetriNetUnfolderBase]: 4098/6567 cut-off events. [2024-11-09 10:32:07,799 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-09 10:32:07,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13189 conditions, 6567 events. 4098/6567 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 44493 event pairs, 784 based on Foata normal form. 16/6071 useless extension candidates. Maximal degree in co-relation 13178. Up to 2143 conditions per place. [2024-11-09 10:32:07,841 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 64 selfloop transitions, 8 changer transitions 22/125 dead transitions. [2024-11-09 10:32:07,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 125 transitions, 522 flow [2024-11-09 10:32:07,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:32:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:32:07,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 325 transitions. [2024-11-09 10:32:07,843 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6132075471698113 [2024-11-09 10:32:07,844 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 168 flow. Second operand 10 states and 325 transitions. [2024-11-09 10:32:07,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 125 transitions, 522 flow [2024-11-09 10:32:07,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 125 transitions, 515 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-09 10:32:07,848 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 194 flow [2024-11-09 10:32:07,848 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=194, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2024-11-09 10:32:07,849 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 13 predicate places. [2024-11-09 10:32:07,849 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 194 flow [2024-11-09 10:32:07,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 24.666666666666668) internal successors, (296), 12 states have internal predecessors, (296), 0 states have call successors, (0), 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-09 10:32:07,849 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:07,850 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:32:07,855 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 (9)] Ended with exit code 0 [2024-11-09 10:32:08,050 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-09 10:32:08,051 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:32:08,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:08,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1288887807, now seen corresponding path program 3 times [2024-11-09 10:32:08,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:08,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929226666] [2024-11-09 10:32:08,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:32:08,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:32:08,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:08,057 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-09 10:32:08,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 (10)] Waiting until timeout for monitored process [2024-11-09 10:32:08,161 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 10:32:08,162 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:32:08,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:32:08,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:08,259 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-09 10:32:08,259 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:08,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:08,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929226666] [2024-11-09 10:32:08,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929226666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:08,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:08,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:32:08,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015896868] [2024-11-09 10:32:08,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:08,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:32:08,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:08,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:32:08,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:32:08,277 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-11-09 10:32:08,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 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-09 10:32:08,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:08,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-11-09 10:32:08,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:09,565 INFO L124 PetriNetUnfolderBase]: 7833/12836 cut-off events. [2024-11-09 10:32:09,566 INFO L125 PetriNetUnfolderBase]: For 612/614 co-relation queries the response was YES. [2024-11-09 10:32:09,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26405 conditions, 12836 events. 7833/12836 cut-off events. For 612/614 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 98359 event pairs, 1382 based on Foata normal form. 16/11874 useless extension candidates. Maximal degree in co-relation 26392. Up to 4974 conditions per place. [2024-11-09 10:32:09,609 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 49 selfloop transitions, 2 changer transitions 13/96 dead transitions. [2024-11-09 10:32:09,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 96 transitions, 418 flow [2024-11-09 10:32:09,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:32:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:32:09,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2024-11-09 10:32:09,611 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6037735849056604 [2024-11-09 10:32:09,612 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 194 flow. Second operand 6 states and 192 transitions. [2024-11-09 10:32:09,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 96 transitions, 418 flow [2024-11-09 10:32:09,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 96 transitions, 411 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-09 10:32:09,620 INFO L231 Difference]: Finished difference. Result has 77 places, 60 transitions, 206 flow [2024-11-09 10:32:09,620 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=77, PETRI_TRANSITIONS=60} [2024-11-09 10:32:09,621 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 17 predicate places. [2024-11-09 10:32:09,622 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 60 transitions, 206 flow [2024-11-09 10:32:09,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 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-09 10:32:09,623 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:09,623 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:32:09,629 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 (10)] Ended with exit code 0 [2024-11-09 10:32:09,823 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-09 10:32:09,824 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:32:09,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:09,824 INFO L85 PathProgramCache]: Analyzing trace with hash 930791067, now seen corresponding path program 4 times [2024-11-09 10:32:09,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:09,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020561995] [2024-11-09 10:32:09,825 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:32:09,825 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-09 10:32:09,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:09,828 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:32:09,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 10:32:09,935 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 10:32:09,935 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:32:09,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:32:09,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:32:10,089 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-09 10:32:10,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:32:10,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:32:10,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020561995] [2024-11-09 10:32:10,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020561995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:32:10,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:32:10,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:32:10,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816660728] [2024-11-09 10:32:10,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:32:10,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:32:10,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:32:10,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:32:10,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:32:10,100 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-11-09 10:32:10,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 60 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 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-09 10:32:10,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:32:10,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-11-09 10:32:10,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:32:11,650 INFO L124 PetriNetUnfolderBase]: 13945/22962 cut-off events. [2024-11-09 10:32:11,650 INFO L125 PetriNetUnfolderBase]: For 1935/1937 co-relation queries the response was YES. [2024-11-09 10:32:11,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47999 conditions, 22962 events. 13945/22962 cut-off events. For 1935/1937 co-relation queries the response was YES. Maximal size of possible extension queue 1680. Compared 191352 event pairs, 3100 based on Foata normal form. 16/21350 useless extension candidates. Maximal degree in co-relation 47984. Up to 8629 conditions per place. [2024-11-09 10:32:11,736 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 28 selfloop transitions, 1 changer transitions 36/95 dead transitions. [2024-11-09 10:32:11,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 95 transitions, 424 flow [2024-11-09 10:32:11,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:32:11,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:32:11,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2024-11-09 10:32:11,738 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5943396226415094 [2024-11-09 10:32:11,738 INFO L175 Difference]: Start difference. First operand has 77 places, 60 transitions, 206 flow. Second operand 6 states and 189 transitions. [2024-11-09 10:32:11,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 95 transitions, 424 flow [2024-11-09 10:32:11,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 95 transitions, 417 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-09 10:32:11,779 INFO L231 Difference]: Finished difference. Result has 81 places, 56 transitions, 193 flow [2024-11-09 10:32:11,779 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=81, PETRI_TRANSITIONS=56} [2024-11-09 10:32:11,780 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 21 predicate places. [2024-11-09 10:32:11,780 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 56 transitions, 193 flow [2024-11-09 10:32:11,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 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-09 10:32:11,780 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:32:11,781 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:32:11,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-09 10:32:11,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:32:11,985 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-09 10:32:11,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:32:11,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1715950473, now seen corresponding path program 5 times [2024-11-09 10:32:11,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:32:11,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267561090] [2024-11-09 10:32:11,986 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:32:11,986 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-09 10:32:11,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:32:11,987 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:32:11,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 10:32:12,080 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 10:32:12,081 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 10:32:12,081 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:32:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:32:12,203 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 10:32:12,204 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:32:12,206 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-09 10:32:12,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-09 10:32:12,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-09 10:32:12,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-09 10:32:12,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-09 10:32:12,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-09 10:32:12,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-09 10:32:12,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-09 10:32:12,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 10:32:12,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:32:12,411 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2024-11-09 10:32:12,530 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:32:12,530 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:32:12,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:32:12 BasicIcfg [2024-11-09 10:32:12,537 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:32:12,538 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:32:12,538 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:32:12,538 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:32:12,539 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:31:56" (3/4) ... [2024-11-09 10:32:12,540 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:32:12,541 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:32:12,542 INFO L158 Benchmark]: Toolchain (without parser) took 18173.37ms. Allocated memory was 83.9MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 54.2MB in the beginning and 1.0GB in the end (delta: -984.2MB). Peak memory consumption was 642.2MB. Max. memory is 16.1GB. [2024-11-09 10:32:12,542 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 65.0MB. Free memory was 36.5MB in the beginning and 36.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:32:12,543 INFO L158 Benchmark]: CACSL2BoogieTranslator took 635.23ms. Allocated memory is still 83.9MB. Free memory was 54.0MB in the beginning and 48.7MB in the end (delta: 5.3MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2024-11-09 10:32:12,543 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.38ms. Allocated memory is still 83.9MB. Free memory was 48.7MB in the beginning and 46.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:32:12,543 INFO L158 Benchmark]: Boogie Preprocessor took 75.65ms. Allocated memory is still 83.9MB. Free memory was 46.0MB in the beginning and 42.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:32:12,543 INFO L158 Benchmark]: RCFGBuilder took 912.55ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 42.1MB in the beginning and 72.1MB in the end (delta: -30.0MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-11-09 10:32:12,544 INFO L158 Benchmark]: TraceAbstraction took 16465.74ms. Allocated memory was 100.7MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 72.0MB in the beginning and 1.0GB in the end (delta: -967.5MB). Peak memory consumption was 644.2MB. Max. memory is 16.1GB. [2024-11-09 10:32:12,544 INFO L158 Benchmark]: Witness Printer took 3.76ms. Allocated memory is still 1.7GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:32:12,545 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.19ms. Allocated memory is still 65.0MB. Free memory was 36.5MB in the beginning and 36.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 635.23ms. Allocated memory is still 83.9MB. Free memory was 54.0MB in the beginning and 48.7MB in the end (delta: 5.3MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.38ms. Allocated memory is still 83.9MB. Free memory was 48.7MB in the beginning and 46.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.65ms. Allocated memory is still 83.9MB. Free memory was 46.0MB in the beginning and 42.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 912.55ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 42.1MB in the beginning and 72.1MB in the end (delta: -30.0MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * TraceAbstraction took 16465.74ms. Allocated memory was 100.7MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 72.0MB in the beginning and 1.0GB in the end (delta: -967.5MB). Peak memory consumption was 644.2MB. Max. memory is 16.1GB. * Witness Printer took 3.76ms. Allocated memory is still 1.7GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1377; [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L850] 0 pthread_t t1378; [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=0, t1378=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [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_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L852] 0 pthread_t t1379; [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1377=0, t1378=1, t1379=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L800] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L854] 0 pthread_t t1380; [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1377=0, t1378=1, t1379=2, t1380=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 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) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 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 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L820] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L756] 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) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 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 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L826] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L786] 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) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 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 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=0, t1378=1, t1379=2, t1380=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 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) [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 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 [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=0, t1378=1, t1379=2, t1380=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] 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) [L873] 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)) [L874] 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)) [L875] 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)) [L876] 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)) [L877] 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)) [L878] 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)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=0, t1378=1, t1379=2, t1380=3, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L883] 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}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=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", "mix051_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=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: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 849]: 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: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 8 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: 16.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 652 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 633 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1809 IncrementalHoareTripleChecker+Invalid, 1893 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 13 mSDtfsCounter, 1809 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=5, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 326 NumberOfCodeBlocks, 325 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 1294 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1303 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 10:32:12,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample