./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.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 dcc3fad0768415d67ba0b5226238487b935d262c55e83ab1790d239680fbb73d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 17:24:18,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:24:18,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 17:24:18,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:24:18,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:24:18,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:24:18,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:24:18,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:24:18,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:24:18,839 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:24:18,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:24:18,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:24:18,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:24:18,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:24:18,841 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:24:18,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:24:18,842 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:24:18,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:24:18,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:24:18,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:24:18,845 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:24:18,845 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:24:18,846 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:24:18,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:24:18,846 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:24:18,846 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:24:18,847 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:24:18,847 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:24:18,847 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:24:18,847 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:24:18,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:24:18,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:24:18,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:24:18,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:24:18,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:24:18,848 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:24:18,849 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 17:24:18,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 17:24:18,850 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:24:18,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:24:18,851 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:24:18,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:24:18,851 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 -> dcc3fad0768415d67ba0b5226238487b935d262c55e83ab1790d239680fbb73d [2024-11-20 17:24:19,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:24:19,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:24:19,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:24:19,131 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:24:19,132 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:24:19,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i [2024-11-20 17:24:20,531 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:24:20,818 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:24:20,818 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i [2024-11-20 17:24:20,836 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88e7b33a1/128843b92c874cb6b3f336ece28d8202/FLAG435924c6e [2024-11-20 17:24:20,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88e7b33a1/128843b92c874cb6b3f336ece28d8202 [2024-11-20 17:24:20,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:24:20,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:24:20,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:24:20,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:24:20,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:24:20,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:24:20" (1/1) ... [2024-11-20 17:24:20,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@842a54d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:20, skipping insertion in model container [2024-11-20 17:24:20,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:24:20" (1/1) ... [2024-11-20 17:24:20,912 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:24:21,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:24:21,364 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:24:21,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:24:21,498 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:24:21,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21 WrapperNode [2024-11-20 17:24:21,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:24:21,500 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:24:21,500 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:24:21,500 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:24:21,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (1/1) ... [2024-11-20 17:24:21,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (1/1) ... [2024-11-20 17:24:21,573 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 131 [2024-11-20 17:24:21,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:24:21,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:24:21,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:24:21,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:24:21,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (1/1) ... [2024-11-20 17:24:21,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (1/1) ... [2024-11-20 17:24:21,597 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (1/1) ... [2024-11-20 17:24:21,626 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-20 17:24:21,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (1/1) ... [2024-11-20 17:24:21,627 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (1/1) ... [2024-11-20 17:24:21,637 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (1/1) ... [2024-11-20 17:24:21,643 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (1/1) ... [2024-11-20 17:24:21,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (1/1) ... [2024-11-20 17:24:21,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (1/1) ... [2024-11-20 17:24:21,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:24:21,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:24:21,659 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:24:21,659 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:24:21,660 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (1/1) ... [2024-11-20 17:24:21,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:24:21,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:24:21,709 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-20 17:24:21,717 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-20 17:24:21,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-20 17:24:21,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:24:21,770 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-20 17:24:21,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-20 17:24:21,770 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-20 17:24:21,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-20 17:24:21,770 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-20 17:24:21,771 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-20 17:24:21,771 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-20 17:24:21,771 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-20 17:24:21,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 17:24:21,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-20 17:24:21,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:24:21,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:24:21,774 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 17:24:21,920 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:24:21,922 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:24:22,346 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 17:24:22,346 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:24:22,557 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:24:22,558 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 17:24:22,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:24:22 BoogieIcfgContainer [2024-11-20 17:24:22,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:24:22,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:24:22,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:24:22,567 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:24:22,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:24:20" (1/3) ... [2024-11-20 17:24:22,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326b2e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:24:22, skipping insertion in model container [2024-11-20 17:24:22,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (2/3) ... [2024-11-20 17:24:22,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326b2e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:24:22, skipping insertion in model container [2024-11-20 17:24:22,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:24:22" (3/3) ... [2024-11-20 17:24:22,570 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.oepc_pso.oepc_rmo.oepc.i [2024-11-20 17:24:22,589 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:24:22,589 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-20 17:24:22,590 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 17:24:22,658 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 17:24:22,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2024-11-20 17:24:22,731 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2024-11-20 17:24:22,731 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:24:22,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 112 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-11-20 17:24:22,738 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2024-11-20 17:24:22,744 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2024-11-20 17:24:22,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:24:22,760 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;@4ebd9525, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:24:22,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-20 17:24:22,763 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 17:24:22,764 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-20 17:24:22,764 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:24:22,764 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:24:22,765 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-20 17:24:22,765 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:24:22,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:24:22,771 INFO L85 PathProgramCache]: Analyzing trace with hash 12923227, now seen corresponding path program 1 times [2024-11-20 17:24:22,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:24:22,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987974550] [2024-11-20 17:24:22,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:24:22,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:24:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:24:23,240 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-20 17:24:23,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:24:23,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987974550] [2024-11-20 17:24:23,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987974550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:24:23,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:24:23,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:24:23,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049744902] [2024-11-20 17:24:23,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:24:23,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:24:23,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:24:23,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:24:23,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:24:23,309 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2024-11-20 17:24:23,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:24:23,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:24:23,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2024-11-20 17:24:23,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:24:24,323 INFO L124 PetriNetUnfolderBase]: 3311/5215 cut-off events. [2024-11-20 17:24:24,324 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-20 17:24:24,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9895 conditions, 5215 events. 3311/5215 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 33415 event pairs, 2177 based on Foata normal form. 288/5455 useless extension candidates. Maximal degree in co-relation 9883. Up to 3661 conditions per place. [2024-11-20 17:24:24,365 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 41 selfloop transitions, 2 changer transitions 2/67 dead transitions. [2024-11-20 17:24:24,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 67 transitions, 245 flow [2024-11-20 17:24:24,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:24:24,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:24:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2024-11-20 17:24:24,377 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7757575757575758 [2024-11-20 17:24:24,379 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 128 transitions. [2024-11-20 17:24:24,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 67 transitions, 245 flow [2024-11-20 17:24:24,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 67 transitions, 238 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-20 17:24:24,388 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-11-20 17:24:24,392 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-20 17:24:24,397 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-11-20 17:24:24,397 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-11-20 17:24:24,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:24:24,398 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:24:24,398 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:24:24,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 17:24:24,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:24:24,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:24:24,399 INFO L85 PathProgramCache]: Analyzing trace with hash 610534324, now seen corresponding path program 1 times [2024-11-20 17:24:24,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:24:24,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321314299] [2024-11-20 17:24:24,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:24:24,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:24:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:24:24,472 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-20 17:24:24,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:24:24,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321314299] [2024-11-20 17:24:24,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321314299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:24:24,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:24:24,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:24:24,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903371313] [2024-11-20 17:24:24,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:24:24,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:24:24,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:24:24,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:24:24,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:24:24,480 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-11-20 17:24:24,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 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-20 17:24:24,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:24:24,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-11-20 17:24:24,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:24:25,249 INFO L124 PetriNetUnfolderBase]: 2903/4947 cut-off events. [2024-11-20 17:24:25,250 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2024-11-20 17:24:25,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9351 conditions, 4947 events. 2903/4947 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 35215 event pairs, 2903 based on Foata normal form. 144/4916 useless extension candidates. Maximal degree in co-relation 9341. Up to 4016 conditions per place. [2024-11-20 17:24:25,288 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 22 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2024-11-20 17:24:25,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 150 flow [2024-11-20 17:24:25,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:24:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:24:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-11-20 17:24:25,290 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-11-20 17:24:25,290 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 100 transitions. [2024-11-20 17:24:25,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 150 flow [2024-11-20 17:24:25,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 17:24:25,292 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2024-11-20 17:24:25,292 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-11-20 17:24:25,293 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2024-11-20 17:24:25,293 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2024-11-20 17:24:25,293 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-20 17:24:25,293 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:24:25,294 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:24:25,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 17:24:25,294 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:24:25,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:24:25,295 INFO L85 PathProgramCache]: Analyzing trace with hash 610535703, now seen corresponding path program 1 times [2024-11-20 17:24:25,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:24:25,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231259952] [2024-11-20 17:24:25,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:24:25,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:24:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:24:25,515 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-20 17:24:25,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:24:25,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231259952] [2024-11-20 17:24:25,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231259952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:24:25,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:24:25,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:24:25,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587011501] [2024-11-20 17:24:25,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:24:25,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:24:25,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:24:25,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:24:25,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:24:25,532 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-20 17:24:25,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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-20 17:24:25,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:24:25,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-20 17:24:25,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:24:27,153 INFO L124 PetriNetUnfolderBase]: 8875/13639 cut-off events. [2024-11-20 17:24:27,153 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:24:27,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25961 conditions, 13639 events. 8875/13639 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 96399 event pairs, 1033 based on Foata normal form. 400/13818 useless extension candidates. Maximal degree in co-relation 25955. Up to 7301 conditions per place. [2024-11-20 17:24:27,241 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 53 selfloop transitions, 6 changer transitions 1/76 dead transitions. [2024-11-20 17:24:27,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 76 transitions, 288 flow [2024-11-20 17:24:27,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:24:27,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 17:24:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2024-11-20 17:24:27,243 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6636363636363637 [2024-11-20 17:24:27,243 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 4 states and 146 transitions. [2024-11-20 17:24:27,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 76 transitions, 288 flow [2024-11-20 17:24:27,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 76 transitions, 287 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:24:27,246 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 139 flow [2024-11-20 17:24:27,246 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, 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=139, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2024-11-20 17:24:27,247 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2024-11-20 17:24:27,247 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 139 flow [2024-11-20 17:24:27,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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-20 17:24:27,248 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:24:27,248 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-20 17:24:27,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 17:24:27,248 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:24:27,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:24:27,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1445226634, now seen corresponding path program 1 times [2024-11-20 17:24:27,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:24:27,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244378210] [2024-11-20 17:24:27,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:24:27,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:24:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:24:27,520 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-20 17:24:27,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:24:27,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244378210] [2024-11-20 17:24:27,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244378210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:24:27,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:24:27,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:24:27,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065780147] [2024-11-20 17:24:27,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:24:27,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:24:27,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:24:27,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:24:27,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:24:27,537 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-20 17:24:27,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 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-20 17:24:27,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:24:27,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-20 17:24:27,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:24:28,996 INFO L124 PetriNetUnfolderBase]: 6751/10399 cut-off events. [2024-11-20 17:24:28,996 INFO L125 PetriNetUnfolderBase]: For 2428/2428 co-relation queries the response was YES. [2024-11-20 17:24:29,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23256 conditions, 10399 events. 6751/10399 cut-off events. For 2428/2428 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 69427 event pairs, 451 based on Foata normal form. 364/10577 useless extension candidates. Maximal degree in co-relation 23247. Up to 4601 conditions per place. [2024-11-20 17:24:29,084 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 68 selfloop transitions, 10 changer transitions 1/95 dead transitions. [2024-11-20 17:24:29,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 95 transitions, 420 flow [2024-11-20 17:24:29,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:24:29,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:24:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 186 transitions. [2024-11-20 17:24:29,088 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6763636363636364 [2024-11-20 17:24:29,088 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 139 flow. Second operand 5 states and 186 transitions. [2024-11-20 17:24:29,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 95 transitions, 420 flow [2024-11-20 17:24:29,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 95 transitions, 409 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-20 17:24:29,094 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 191 flow [2024-11-20 17:24:29,094 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=191, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2024-11-20 17:24:29,095 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2024-11-20 17:24:29,096 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 191 flow [2024-11-20 17:24:29,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 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-20 17:24:29,097 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:24:29,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] [2024-11-20 17:24:29,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 17:24:29,099 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:24:29,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:24:29,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1494696936, now seen corresponding path program 1 times [2024-11-20 17:24:29,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:24:29,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798649582] [2024-11-20 17:24:29,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:24:29,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:24:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:24:29,454 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-20 17:24:29,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:24:29,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798649582] [2024-11-20 17:24:29,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798649582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:24:29,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:24:29,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:24:29,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867631390] [2024-11-20 17:24:29,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:24:29,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:24:29,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:24:29,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:24:29,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:24:29,471 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-20 17:24:29,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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-20 17:24:29,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:24:29,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-20 17:24:29,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:24:30,367 INFO L124 PetriNetUnfolderBase]: 4259/6455 cut-off events. [2024-11-20 17:24:30,368 INFO L125 PetriNetUnfolderBase]: For 4750/4750 co-relation queries the response was YES. [2024-11-20 17:24:30,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16298 conditions, 6455 events. 4259/6455 cut-off events. For 4750/4750 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 37603 event pairs, 289 based on Foata normal form. 244/6535 useless extension candidates. Maximal degree in co-relation 16287. Up to 1788 conditions per place. [2024-11-20 17:24:30,408 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 81 selfloop transitions, 14 changer transitions 1/112 dead transitions. [2024-11-20 17:24:30,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 112 transitions, 551 flow [2024-11-20 17:24:30,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:24:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:24:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 224 transitions. [2024-11-20 17:24:30,411 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6787878787878788 [2024-11-20 17:24:30,411 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 191 flow. Second operand 6 states and 224 transitions. [2024-11-20 17:24:30,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 112 transitions, 551 flow [2024-11-20 17:24:30,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 112 transitions, 521 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-20 17:24:30,434 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 241 flow [2024-11-20 17:24:30,435 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=59, 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=241, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2024-11-20 17:24:30,435 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2024-11-20 17:24:30,435 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 241 flow [2024-11-20 17:24:30,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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-20 17:24:30,436 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:24:30,436 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-20 17:24:30,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 17:24:30,436 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:24:30,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:24:30,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1947283072, now seen corresponding path program 1 times [2024-11-20 17:24:30,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:24:30,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139513321] [2024-11-20 17:24:30,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:24:30,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:24:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:24:30,746 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-20 17:24:30,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:24:30,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139513321] [2024-11-20 17:24:30,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139513321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:24:30,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:24:30,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 17:24:30,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458327037] [2024-11-20 17:24:30,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:24:30,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 17:24:30,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:24:30,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 17:24:30,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:24:30,753 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-20 17:24:30,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 241 flow. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 0 states have call successors, (0), 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-20 17:24:30,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:24:30,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-20 17:24:30,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:24:31,300 INFO L124 PetriNetUnfolderBase]: 2895/4223 cut-off events. [2024-11-20 17:24:31,301 INFO L125 PetriNetUnfolderBase]: For 5022/5022 co-relation queries the response was YES. [2024-11-20 17:24:31,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11699 conditions, 4223 events. 2895/4223 cut-off events. For 5022/5022 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 21898 event pairs, 231 based on Foata normal form. 96/4159 useless extension candidates. Maximal degree in co-relation 11687. Up to 1316 conditions per place. [2024-11-20 17:24:31,331 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 72 selfloop transitions, 18 changer transitions 1/107 dead transitions. [2024-11-20 17:24:31,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 107 transitions, 541 flow [2024-11-20 17:24:31,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 17:24:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-20 17:24:31,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 240 transitions. [2024-11-20 17:24:31,333 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6233766233766234 [2024-11-20 17:24:31,333 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 241 flow. Second operand 7 states and 240 transitions. [2024-11-20 17:24:31,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 107 transitions, 541 flow [2024-11-20 17:24:31,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 107 transitions, 495 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-20 17:24:31,367 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 251 flow [2024-11-20 17:24:31,368 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=61, 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=251, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2024-11-20 17:24:31,369 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2024-11-20 17:24:31,369 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 251 flow [2024-11-20 17:24:31,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 0 states have call successors, (0), 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-20 17:24:31,369 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:24:31,369 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, 1, 1] [2024-11-20 17:24:31,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 17:24:31,370 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:24:31,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:24:31,370 INFO L85 PathProgramCache]: Analyzing trace with hash -960845547, now seen corresponding path program 1 times [2024-11-20 17:24:31,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:24:31,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243916044] [2024-11-20 17:24:31,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:24:31,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:24:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:24:33,608 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-20 17:24:33,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:24:33,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243916044] [2024-11-20 17:24:33,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243916044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:24:33,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:24:33,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 17:24:33,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224426039] [2024-11-20 17:24:33,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:24:33,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 17:24:33,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:24:33,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 17:24:33,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:24:33,625 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-11-20 17:24:33,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 251 flow. Second operand has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 0 states have call successors, (0), 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-20 17:24:33,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:24:33,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-11-20 17:24:33,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:24:34,646 INFO L124 PetriNetUnfolderBase]: 3348/5515 cut-off events. [2024-11-20 17:24:34,646 INFO L125 PetriNetUnfolderBase]: For 3279/3523 co-relation queries the response was YES. [2024-11-20 17:24:34,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13213 conditions, 5515 events. 3348/5515 cut-off events. For 3279/3523 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 36723 event pairs, 879 based on Foata normal form. 16/5154 useless extension candidates. Maximal degree in co-relation 13200. Up to 1668 conditions per place. [2024-11-20 17:24:34,698 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 71 selfloop transitions, 8 changer transitions 12/123 dead transitions. [2024-11-20 17:24:34,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 123 transitions, 603 flow [2024-11-20 17:24:34,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 17:24:34,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 17:24:34,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 292 transitions. [2024-11-20 17:24:34,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6636363636363637 [2024-11-20 17:24:34,700 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 251 flow. Second operand 8 states and 292 transitions. [2024-11-20 17:24:34,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 123 transitions, 603 flow [2024-11-20 17:24:34,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 123 transitions, 487 flow, removed 27 selfloop flow, removed 10 redundant places. [2024-11-20 17:24:34,742 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 210 flow [2024-11-20 17:24:34,742 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2024-11-20 17:24:34,743 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 9 predicate places. [2024-11-20 17:24:34,743 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 210 flow [2024-11-20 17:24:34,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 0 states have call successors, (0), 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-20 17:24:34,744 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:24:34,744 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, 1, 1] [2024-11-20 17:24:34,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 17:24:34,744 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:24:34,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:24:34,745 INFO L85 PathProgramCache]: Analyzing trace with hash 544960051, now seen corresponding path program 2 times [2024-11-20 17:24:34,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:24:34,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830722556] [2024-11-20 17:24:34,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:24:34,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:24:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:24:35,152 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-20 17:24:35,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:24:35,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830722556] [2024-11-20 17:24:35,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830722556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:24:35,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:24:35,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:24:35,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416774968] [2024-11-20 17:24:35,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:24:35,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:24:35,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:24:35,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:24:35,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:24:35,172 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 55 [2024-11-20 17:24:35,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:24:35,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:24:35,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 55 [2024-11-20 17:24:35,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:24:37,303 INFO L124 PetriNetUnfolderBase]: 18885/28548 cut-off events. [2024-11-20 17:24:37,304 INFO L125 PetriNetUnfolderBase]: For 6459/6459 co-relation queries the response was YES. [2024-11-20 17:24:37,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65460 conditions, 28548 events. 18885/28548 cut-off events. For 6459/6459 co-relation queries the response was YES. Maximal size of possible extension queue 1399. Compared 206066 event pairs, 6680 based on Foata normal form. 32/27387 useless extension candidates. Maximal degree in co-relation 65447. Up to 13115 conditions per place. [2024-11-20 17:24:37,566 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 50 selfloop transitions, 10 changer transitions 17/102 dead transitions. [2024-11-20 17:24:37,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 102 transitions, 487 flow [2024-11-20 17:24:37,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:24:37,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:24:37,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-11-20 17:24:37,568 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5672727272727273 [2024-11-20 17:24:37,568 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 210 flow. Second operand 5 states and 156 transitions. [2024-11-20 17:24:37,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 102 transitions, 487 flow [2024-11-20 17:24:37,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 102 transitions, 469 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-20 17:24:37,631 INFO L231 Difference]: Finished difference. Result has 73 places, 70 transitions, 281 flow [2024-11-20 17:24:37,631 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=281, PETRI_PLACES=73, PETRI_TRANSITIONS=70} [2024-11-20 17:24:37,631 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 11 predicate places. [2024-11-20 17:24:37,632 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 70 transitions, 281 flow [2024-11-20 17:24:37,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:24:37,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:24:37,632 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, 1, 1] [2024-11-20 17:24:37,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 17:24:37,633 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:24:37,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:24:37,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1898699755, now seen corresponding path program 3 times [2024-11-20 17:24:37,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:24:37,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524009820] [2024-11-20 17:24:37,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:24:37,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:24:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:24:37,955 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-20 17:24:37,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:24:37,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524009820] [2024-11-20 17:24:37,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524009820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:24:37,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:24:37,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 17:24:37,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603759654] [2024-11-20 17:24:37,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:24:37,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:24:37,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:24:37,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:24:37,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:24:37,972 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 55 [2024-11-20 17:24:37,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:24:37,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:24:37,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 55 [2024-11-20 17:24:37,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:24:40,362 INFO L124 PetriNetUnfolderBase]: 23886/36307 cut-off events. [2024-11-20 17:24:40,362 INFO L125 PetriNetUnfolderBase]: For 21176/21318 co-relation queries the response was YES. [2024-11-20 17:24:40,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97274 conditions, 36307 events. 23886/36307 cut-off events. For 21176/21318 co-relation queries the response was YES. Maximal size of possible extension queue 1793. Compared 275685 event pairs, 5519 based on Foata normal form. 91/34821 useless extension candidates. Maximal degree in co-relation 97259. Up to 14251 conditions per place. [2024-11-20 17:24:40,584 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 66 selfloop transitions, 12 changer transitions 34/137 dead transitions. [2024-11-20 17:24:40,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 137 transitions, 753 flow [2024-11-20 17:24:40,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:24:40,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:24:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2024-11-20 17:24:40,587 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-11-20 17:24:40,587 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 281 flow. Second operand 6 states and 198 transitions. [2024-11-20 17:24:40,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 137 transitions, 753 flow [2024-11-20 17:24:40,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 137 transitions, 707 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-20 17:24:40,661 INFO L231 Difference]: Finished difference. Result has 75 places, 73 transitions, 333 flow [2024-11-20 17:24:40,661 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=333, PETRI_PLACES=75, PETRI_TRANSITIONS=73} [2024-11-20 17:24:40,661 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 13 predicate places. [2024-11-20 17:24:40,662 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 73 transitions, 333 flow [2024-11-20 17:24:40,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:24:40,662 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:24:40,662 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, 1, 1] [2024-11-20 17:24:40,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 17:24:40,662 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:24:40,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:24:40,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1104642143, now seen corresponding path program 4 times [2024-11-20 17:24:40,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:24:40,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167425439] [2024-11-20 17:24:40,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:24:40,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:24:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:24:40,990 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-20 17:24:40,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:24:40,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167425439] [2024-11-20 17:24:40,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167425439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:24:40,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:24:40,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 17:24:40,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115622607] [2024-11-20 17:24:40,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:24:40,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:24:40,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:24:40,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:24:40,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:24:41,010 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 55 [2024-11-20 17:24:41,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 73 transitions, 333 flow. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:24:41,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:24:41,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 55 [2024-11-20 17:24:41,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:24:42,115 INFO L124 PetriNetUnfolderBase]: 9457/14934 cut-off events. [2024-11-20 17:24:42,115 INFO L125 PetriNetUnfolderBase]: For 13042/13142 co-relation queries the response was YES. [2024-11-20 17:24:42,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40831 conditions, 14934 events. 9457/14934 cut-off events. For 13042/13142 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 104772 event pairs, 2398 based on Foata normal form. 105/14377 useless extension candidates. Maximal degree in co-relation 40814. Up to 5132 conditions per place. [2024-11-20 17:24:42,197 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 67 selfloop transitions, 16 changer transitions 21/129 dead transitions. [2024-11-20 17:24:42,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 129 transitions, 751 flow [2024-11-20 17:24:42,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:24:42,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:24:42,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2024-11-20 17:24:42,199 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2024-11-20 17:24:42,200 INFO L175 Difference]: Start difference. First operand has 75 places, 73 transitions, 333 flow. Second operand 6 states and 194 transitions. [2024-11-20 17:24:42,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 129 transitions, 751 flow [2024-11-20 17:24:42,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 129 transitions, 727 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-11-20 17:24:42,292 INFO L231 Difference]: Finished difference. Result has 77 places, 77 transitions, 417 flow [2024-11-20 17:24:42,292 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=417, PETRI_PLACES=77, PETRI_TRANSITIONS=77} [2024-11-20 17:24:42,294 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 15 predicate places. [2024-11-20 17:24:42,295 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 77 transitions, 417 flow [2024-11-20 17:24:42,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:24:42,296 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:24:42,296 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, 1, 1] [2024-11-20 17:24:42,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 17:24:42,296 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:24:42,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:24:42,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1681539789, now seen corresponding path program 5 times [2024-11-20 17:24:42,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:24:42,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791147823] [2024-11-20 17:24:42,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:24:42,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:24:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:24:43,459 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-20 17:24:43,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:24:43,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791147823] [2024-11-20 17:24:43,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791147823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:24:43,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:24:43,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 17:24:43,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799694541] [2024-11-20 17:24:43,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:24:43,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 17:24:43,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:24:43,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 17:24:43,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:24:43,476 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-11-20 17:24:43,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 417 flow. Second operand has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 0 states have call successors, (0), 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-20 17:24:43,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:24:43,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-11-20 17:24:43,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:24:45,355 INFO L124 PetriNetUnfolderBase]: 10543/17935 cut-off events. [2024-11-20 17:24:45,355 INFO L125 PetriNetUnfolderBase]: For 8269/9523 co-relation queries the response was YES. [2024-11-20 17:24:45,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42836 conditions, 17935 events. 10543/17935 cut-off events. For 8269/9523 co-relation queries the response was YES. Maximal size of possible extension queue 1291. Compared 148033 event pairs, 2588 based on Foata normal form. 372/17181 useless extension candidates. Maximal degree in co-relation 42817. Up to 4663 conditions per place. [2024-11-20 17:24:45,467 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 65 selfloop transitions, 9 changer transitions 17/137 dead transitions. [2024-11-20 17:24:45,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 137 transitions, 803 flow [2024-11-20 17:24:45,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 17:24:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-20 17:24:45,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 306 transitions. [2024-11-20 17:24:45,469 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-11-20 17:24:45,469 INFO L175 Difference]: Start difference. First operand has 77 places, 77 transitions, 417 flow. Second operand 9 states and 306 transitions. [2024-11-20 17:24:45,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 137 transitions, 803 flow [2024-11-20 17:24:45,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 137 transitions, 797 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-20 17:24:45,477 INFO L231 Difference]: Finished difference. Result has 86 places, 81 transitions, 475 flow [2024-11-20 17:24:45,477 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=475, PETRI_PLACES=86, PETRI_TRANSITIONS=81} [2024-11-20 17:24:45,477 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 24 predicate places. [2024-11-20 17:24:45,478 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 81 transitions, 475 flow [2024-11-20 17:24:45,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 0 states have call successors, (0), 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-20 17:24:45,478 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:24:45,478 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, 1, 1] [2024-11-20 17:24:45,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 17:24:45,479 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:24:45,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:24:45,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1837195815, now seen corresponding path program 6 times [2024-11-20 17:24:45,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:24:45,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386393007] [2024-11-20 17:24:45,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:24:45,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:24:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:24:45,760 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-20 17:24:45,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:24:45,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386393007] [2024-11-20 17:24:45,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386393007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:24:45,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:24:45,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:24:45,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990858917] [2024-11-20 17:24:45,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:24:45,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:24:45,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:24:45,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:24:45,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:24:45,772 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-11-20 17:24:45,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 81 transitions, 475 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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-20 17:24:45,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:24:45,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-11-20 17:24:45,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:24:48,709 INFO L124 PetriNetUnfolderBase]: 18449/31020 cut-off events. [2024-11-20 17:24:48,710 INFO L125 PetriNetUnfolderBase]: For 28526/30256 co-relation queries the response was YES. [2024-11-20 17:24:48,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79528 conditions, 31020 events. 18449/31020 cut-off events. For 28526/30256 co-relation queries the response was YES. Maximal size of possible extension queue 2250. Compared 271705 event pairs, 9018 based on Foata normal form. 328/29416 useless extension candidates. Maximal degree in co-relation 79504. Up to 12456 conditions per place. [2024-11-20 17:24:48,991 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 45 selfloop transitions, 2 changer transitions 40/118 dead transitions. [2024-11-20 17:24:48,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 118 transitions, 814 flow [2024-11-20 17:24:48,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:24:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:24:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2024-11-20 17:24:48,993 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.610909090909091 [2024-11-20 17:24:48,993 INFO L175 Difference]: Start difference. First operand has 86 places, 81 transitions, 475 flow. Second operand 5 states and 168 transitions. [2024-11-20 17:24:48,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 118 transitions, 814 flow [2024-11-20 17:24:49,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 118 transitions, 800 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-20 17:24:49,059 INFO L231 Difference]: Finished difference. Result has 87 places, 66 transitions, 330 flow [2024-11-20 17:24:49,059 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=330, PETRI_PLACES=87, PETRI_TRANSITIONS=66} [2024-11-20 17:24:49,060 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 25 predicate places. [2024-11-20 17:24:49,060 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 66 transitions, 330 flow [2024-11-20 17:24:49,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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-20 17:24:49,061 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:24:49,061 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, 1, 1] [2024-11-20 17:24:49,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 17:24:49,061 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:24:49,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:24:49,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1447801981, now seen corresponding path program 7 times [2024-11-20 17:24:49,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:24:49,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855209106] [2024-11-20 17:24:49,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:24:49,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:24:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:24:49,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 17:24:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:24:49,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 17:24:49,297 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 17:24:49,299 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-20 17:24:49,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-20 17:24:49,304 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-20 17:24:49,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-20 17:24:49,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-20 17:24:49,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-20 17:24:49,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-20 17:24:49,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-20 17:24:49,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 17:24:49,309 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1] [2024-11-20 17:24:49,428 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 17:24:49,429 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 17:24:49,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:24:49 BasicIcfg [2024-11-20 17:24:49,438 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 17:24:49,438 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 17:24:49,438 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 17:24:49,438 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 17:24:49,439 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:24:22" (3/4) ... [2024-11-20 17:24:49,441 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 17:24:49,442 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 17:24:49,443 INFO L158 Benchmark]: Toolchain (without parser) took 28586.99ms. Allocated memory was 176.2MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 120.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-11-20 17:24:49,443 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:24:49,444 INFO L158 Benchmark]: CACSL2BoogieTranslator took 639.67ms. Allocated memory is still 176.2MB. Free memory was 120.3MB in the beginning and 92.5MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-20 17:24:49,444 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.91ms. Allocated memory is still 176.2MB. Free memory was 92.5MB in the beginning and 89.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 17:24:49,444 INFO L158 Benchmark]: Boogie Preprocessor took 80.65ms. Allocated memory is still 176.2MB. Free memory was 89.9MB in the beginning and 86.3MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 17:24:49,445 INFO L158 Benchmark]: RCFGBuilder took 900.59ms. Allocated memory is still 176.2MB. Free memory was 86.3MB in the beginning and 101.6MB in the end (delta: -15.3MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2024-11-20 17:24:49,445 INFO L158 Benchmark]: TraceAbstraction took 26875.05ms. Allocated memory was 176.2MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 100.6MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-11-20 17:24:49,445 INFO L158 Benchmark]: Witness Printer took 4.25ms. Allocated memory is still 3.5GB. Free memory is still 1.8GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:24:49,447 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 176.2MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 639.67ms. Allocated memory is still 176.2MB. Free memory was 120.3MB in the beginning and 92.5MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.91ms. Allocated memory is still 176.2MB. Free memory was 92.5MB in the beginning and 89.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.65ms. Allocated memory is still 176.2MB. Free memory was 89.9MB in the beginning and 86.3MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 900.59ms. Allocated memory is still 176.2MB. Free memory was 86.3MB in the beginning and 101.6MB in the end (delta: -15.3MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * TraceAbstraction took 26875.05ms. Allocated memory was 176.2MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 100.6MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 4.25ms. Allocated memory is still 3.5GB. Free memory is still 1.8GB. 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_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool b$flush_delayed; [L720] 0 int b$mem_tmp; [L721] 0 _Bool b$r_buff0_thd0; [L722] 0 _Bool b$r_buff0_thd1; [L723] 0 _Bool b$r_buff0_thd2; [L724] 0 _Bool b$r_buff0_thd3; [L725] 0 _Bool b$r_buff0_thd4; [L726] 0 _Bool b$r_buff1_thd0; [L727] 0 _Bool b$r_buff1_thd1; [L728] 0 _Bool b$r_buff1_thd2; [L729] 0 _Bool b$r_buff1_thd3; [L730] 0 _Bool b$r_buff1_thd4; [L731] 0 _Bool b$read_delayed; [L732] 0 int *b$read_delayed_var; [L733] 0 int b$w_buff0; [L734] 0 _Bool b$w_buff0_used; [L735] 0 int b$w_buff1; [L736] 0 _Bool b$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L867] 0 pthread_t t1249; [L868] FCALL, FORK 0 pthread_create(&t1249, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1249=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 b$w_buff1 = b$w_buff0 [L751] 1 b$w_buff0 = 1 [L752] 1 b$w_buff1_used = b$w_buff0_used [L753] 1 b$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L755] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L756] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L757] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L758] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L759] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L760] 1 b$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L869] 0 pthread_t t1250; [L870] FCALL, FORK 0 pthread_create(&t1250, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1249=-3, t1250=-2, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L787] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L788] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L789] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L790] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L871] 0 pthread_t t1251; [L872] FCALL, FORK 0 pthread_create(&t1251, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1249=-3, t1250=-2, t1251=-1, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L800] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L873] 0 pthread_t t1252; [L874] FCALL, FORK 0 pthread_create(&t1252, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1249=-3, t1250=-2, t1251=-1, t1252=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L803] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L806] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L807] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L808] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L809] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L810] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L820] 4 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L823] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L826] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L829] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 4 b$flush_delayed = weak$$choice2 [L832] 4 b$mem_tmp = b [L833] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L834] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L835] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L836] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L837] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L839] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 __unbuffered_p3_EBX = b [L841] 4 b = b$flush_delayed ? b$mem_tmp : b [L842] 4 b$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z=2] [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z=2] [L845] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L846] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L847] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L848] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L849] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z=2] [L773] 1 __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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z=2] [L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z=2] [L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1249=-3, t1250=-2, t1251=-1, t1252=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z=2] [L878] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L878] RET 0 assume_abort_if_not(main$tmp_guard0) [L880] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L881] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L882] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L883] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L884] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1249=-3, t1250=-2, t1251=-1, t1252=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z=2] [L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1249=-3, t1250=-2, t1251=-1, t1252=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z=2] [L889] 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z=2] [L17] 0 __assert_fail ("0", "mix047_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z=2] - 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: 865]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 872]: 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: 870]: 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: 868]: 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: 874]: 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, 89 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: 26.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 764 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 730 mSDsluCounter, 215 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 181 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1958 IncrementalHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 34 mSDtfsCounter, 1958 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=475occurred in iteration=11, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 341 ConstructedInterpolants, 0 QuantifiedInterpolants, 2047 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-20 17:24:49,473 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.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 dcc3fad0768415d67ba0b5226238487b935d262c55e83ab1790d239680fbb73d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 17:24:52,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:24:52,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-20 17:24:52,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:24:52,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:24:52,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:24:52,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:24:52,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:24:52,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:24:52,141 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:24:52,141 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:24:52,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:24:52,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:24:52,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:24:52,143 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:24:52,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:24:52,143 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:24:52,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:24:52,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:24:52,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:24:52,145 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:24:52,148 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:24:52,148 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:24:52,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:24:52,148 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:24:52,149 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 17:24:52,149 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:24:52,149 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 17:24:52,149 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:24:52,149 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:24:52,150 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:24:52,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:24:52,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:24:52,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:24:52,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:24:52,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:24:52,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:24:52,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:24:52,153 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 17:24:52,153 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 17:24:52,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:24:52,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:24:52,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:24:52,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:24:52,154 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 -> dcc3fad0768415d67ba0b5226238487b935d262c55e83ab1790d239680fbb73d [2024-11-20 17:24:52,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:24:52,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:24:52,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:24:52,490 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:24:52,490 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:24:52,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i [2024-11-20 17:24:54,027 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:24:54,286 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:24:54,286 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i [2024-11-20 17:24:54,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6500836e2/812cdcb2083c40b9b14aa5cb66020a85/FLAG855101d85 [2024-11-20 17:24:54,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6500836e2/812cdcb2083c40b9b14aa5cb66020a85 [2024-11-20 17:24:54,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:24:54,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:24:54,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:24:54,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:24:54,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:24:54,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:24:54" (1/1) ... [2024-11-20 17:24:54,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774f532e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:54, skipping insertion in model container [2024-11-20 17:24:54,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:24:54" (1/1) ... [2024-11-20 17:24:54,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:24:55,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:24:55,133 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:24:55,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:24:55,242 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:24:55,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:55 WrapperNode [2024-11-20 17:24:55,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:24:55,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:24:55,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:24:55,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:24:55,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:55" (1/1) ... [2024-11-20 17:24:55,276 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:55" (1/1) ... [2024-11-20 17:24:55,317 INFO L138 Inliner]: procedures = 177, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 132 [2024-11-20 17:24:55,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:24:55,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:24:55,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:24:55,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:24:55,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:55" (1/1) ... [2024-11-20 17:24:55,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:55" (1/1) ... [2024-11-20 17:24:55,342 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:55" (1/1) ... [2024-11-20 17:24:55,370 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-20 17:24:55,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:55" (1/1) ... [2024-11-20 17:24:55,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:55" (1/1) ... [2024-11-20 17:24:55,386 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:55" (1/1) ... [2024-11-20 17:24:55,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:55" (1/1) ... [2024-11-20 17:24:55,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:55" (1/1) ... [2024-11-20 17:24:55,414 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:55" (1/1) ... [2024-11-20 17:24:55,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:24:55,424 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:24:55,425 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:24:55,425 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:24:55,426 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:55" (1/1) ... [2024-11-20 17:24:55,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:24:55,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:24:55,464 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-20 17:24:55,469 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-20 17:24:55,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-20 17:24:55,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:24:55,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 17:24:55,518 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-20 17:24:55,518 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-20 17:24:55,519 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-20 17:24:55,519 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-20 17:24:55,520 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-20 17:24:55,520 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-20 17:24:55,521 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-20 17:24:55,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-20 17:24:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-20 17:24:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:24:55,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:24:55,524 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 17:24:55,659 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:24:55,661 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:24:56,061 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 17:24:56,062 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:24:56,295 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:24:56,296 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 17:24:56,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:24:56 BoogieIcfgContainer [2024-11-20 17:24:56,296 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:24:56,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:24:56,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:24:56,303 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:24:56,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:24:54" (1/3) ... [2024-11-20 17:24:56,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20dd6c32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:24:56, skipping insertion in model container [2024-11-20 17:24:56,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:55" (2/3) ... [2024-11-20 17:24:56,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20dd6c32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:24:56, skipping insertion in model container [2024-11-20 17:24:56,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:24:56" (3/3) ... [2024-11-20 17:24:56,306 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.oepc_pso.oepc_rmo.oepc.i [2024-11-20 17:24:56,320 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:24:56,320 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-20 17:24:56,320 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 17:24:56,385 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 17:24:56,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2024-11-20 17:24:56,451 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2024-11-20 17:24:56,452 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:24:56,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 112 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-11-20 17:24:56,458 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2024-11-20 17:24:56,461 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2024-11-20 17:24:56,482 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:24:56,490 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;@1ef77691, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:24:56,491 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-20 17:24:56,495 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 17:24:56,496 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-20 17:24:56,496 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:24:56,496 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:24:56,497 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-20 17:24:56,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:24:56,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:24:56,504 INFO L85 PathProgramCache]: Analyzing trace with hash 12984795, now seen corresponding path program 1 times [2024-11-20 17:24:56,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:24:56,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840875255] [2024-11-20 17:24:56,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:24:56,517 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-20 17:24:56,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:24:56,520 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-20 17:24:56,521 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-20 17:24:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:24:56,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:24:56,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:24:56,668 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-20 17:24:56,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:24:56,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:24:56,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840875255] [2024-11-20 17:24:56,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840875255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:24:56,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:24:56,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:24:56,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923733780] [2024-11-20 17:24:56,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:24:56,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:24:56,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:24:56,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:24:56,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:24:56,716 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2024-11-20 17:24:56,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:24:56,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:24:56,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2024-11-20 17:24:56,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:24:57,876 INFO L124 PetriNetUnfolderBase]: 3311/5215 cut-off events. [2024-11-20 17:24:57,876 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-20 17:24:57,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9895 conditions, 5215 events. 3311/5215 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 33415 event pairs, 2177 based on Foata normal form. 288/5455 useless extension candidates. Maximal degree in co-relation 9883. Up to 3661 conditions per place. [2024-11-20 17:24:57,928 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 41 selfloop transitions, 2 changer transitions 2/67 dead transitions. [2024-11-20 17:24:57,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 67 transitions, 245 flow [2024-11-20 17:24:57,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:24:57,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:24:57,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2024-11-20 17:24:57,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7757575757575758 [2024-11-20 17:24:57,944 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 128 transitions. [2024-11-20 17:24:57,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 67 transitions, 245 flow [2024-11-20 17:24:57,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 67 transitions, 238 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-20 17:24:57,951 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-11-20 17:24:57,953 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-20 17:24:57,959 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-11-20 17:24:57,959 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-11-20 17:24:57,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:24:57,960 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:24:57,960 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:24:57,966 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-20 17:24:58,163 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-20 17:24:58,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:24:58,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:24:58,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1689387446, now seen corresponding path program 1 times [2024-11-20 17:24:58,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:24:58,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717559202] [2024-11-20 17:24:58,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:24:58,166 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-20 17:24:58,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:24:58,170 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-20 17:24:58,171 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-20 17:24:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:24:58,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:24:58,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:24:58,337 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-20 17:24:58,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:24:58,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:24:58,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717559202] [2024-11-20 17:24:58,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717559202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:24:58,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:24:58,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:24:58,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751443026] [2024-11-20 17:24:58,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:24:58,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:24:58,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:24:58,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:24:58,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:24:58,357 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-20 17:24:58,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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-20 17:24:58,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:24:58,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-20 17:24:58,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:25:00,317 INFO L124 PetriNetUnfolderBase]: 9971/15463 cut-off events. [2024-11-20 17:25:00,317 INFO L125 PetriNetUnfolderBase]: For 690/690 co-relation queries the response was YES. [2024-11-20 17:25:00,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29935 conditions, 15463 events. 9971/15463 cut-off events. For 690/690 co-relation queries the response was YES. Maximal size of possible extension queue 854. Compared 112295 event pairs, 1033 based on Foata normal form. 400/15642 useless extension candidates. Maximal degree in co-relation 29925. Up to 8761 conditions per place. [2024-11-20 17:25:00,436 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 54 selfloop transitions, 6 changer transitions 1/78 dead transitions. [2024-11-20 17:25:00,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 300 flow [2024-11-20 17:25:00,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:25:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 17:25:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2024-11-20 17:25:00,438 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6681818181818182 [2024-11-20 17:25:00,439 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 4 states and 147 transitions. [2024-11-20 17:25:00,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 300 flow [2024-11-20 17:25:00,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 17:25:00,442 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 142 flow [2024-11-20 17:25:00,442 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-11-20 17:25:00,443 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -2 predicate places. [2024-11-20 17:25:00,443 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 142 flow [2024-11-20 17:25:00,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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-20 17:25:00,444 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:25:00,444 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-20 17:25:00,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 17:25:00,644 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-20 17:25:00,645 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:25:00,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:25:00,646 INFO L85 PathProgramCache]: Analyzing trace with hash 69412051, now seen corresponding path program 1 times [2024-11-20 17:25:00,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:25:00,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079968614] [2024-11-20 17:25:00,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:25:00,647 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-20 17:25:00,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:25:00,650 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-20 17:25:00,651 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-20 17:25:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:25:00,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:25:00,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:25:00,792 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-20 17:25:00,793 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:25:00,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:25:00,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079968614] [2024-11-20 17:25:00,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079968614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:25:00,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:25:00,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:25:00,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051509694] [2024-11-20 17:25:00,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:25:00,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:25:00,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:25:00,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:25:00,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:25:00,802 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-20 17:25:00,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 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-20 17:25:00,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:25:00,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-20 17:25:00,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:25:02,337 INFO L124 PetriNetUnfolderBase]: 7427/11563 cut-off events. [2024-11-20 17:25:02,337 INFO L125 PetriNetUnfolderBase]: For 2580/2580 co-relation queries the response was YES. [2024-11-20 17:25:02,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25491 conditions, 11563 events. 7427/11563 cut-off events. For 2580/2580 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 79269 event pairs, 451 based on Foata normal form. 364/11741 useless extension candidates. Maximal degree in co-relation 25479. Up to 5521 conditions per place. [2024-11-20 17:25:02,425 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 69 selfloop transitions, 10 changer transitions 1/97 dead transitions. [2024-11-20 17:25:02,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 97 transitions, 425 flow [2024-11-20 17:25:02,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:25:02,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:25:02,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2024-11-20 17:25:02,428 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-11-20 17:25:02,428 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 142 flow. Second operand 5 states and 187 transitions. [2024-11-20 17:25:02,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 97 transitions, 425 flow [2024-11-20 17:25:02,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 97 transitions, 414 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-20 17:25:02,437 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 194 flow [2024-11-20 17:25:02,438 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-11-20 17:25:02,438 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2024-11-20 17:25:02,439 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 194 flow [2024-11-20 17:25:02,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 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-20 17:25:02,440 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:25:02,440 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-20 17:25:02,445 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-20 17:25:02,643 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-20 17:25:02,645 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:25:02,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:25:02,645 INFO L85 PathProgramCache]: Analyzing trace with hash 206306167, now seen corresponding path program 1 times [2024-11-20 17:25:02,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:25:02,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697423902] [2024-11-20 17:25:02,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:25:02,646 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-20 17:25:02,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:25:02,650 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-20 17:25:02,651 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-20 17:25:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:25:02,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:25:02,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:25:02,795 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-20 17:25:02,798 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:25:02,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:25:02,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697423902] [2024-11-20 17:25:02,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697423902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:25:02,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:25:02,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:25:02,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279933400] [2024-11-20 17:25:02,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:25:02,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:25:02,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:25:02,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:25:02,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:25:02,821 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-20 17:25:02,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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-20 17:25:02,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:25:02,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-20 17:25:02,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:25:03,622 INFO L124 PetriNetUnfolderBase]: 4491/6879 cut-off events. [2024-11-20 17:25:03,622 INFO L125 PetriNetUnfolderBase]: For 4846/4846 co-relation queries the response was YES. [2024-11-20 17:25:03,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17113 conditions, 6879 events. 4491/6879 cut-off events. For 4846/4846 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 40901 event pairs, 289 based on Foata normal form. 244/6959 useless extension candidates. Maximal degree in co-relation 17099. Up to 1969 conditions per place. [2024-11-20 17:25:03,668 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 82 selfloop transitions, 14 changer transitions 1/114 dead transitions. [2024-11-20 17:25:03,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 114 transitions, 556 flow [2024-11-20 17:25:03,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:25:03,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:25:03,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 225 transitions. [2024-11-20 17:25:03,671 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2024-11-20 17:25:03,671 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 194 flow. Second operand 6 states and 225 transitions. [2024-11-20 17:25:03,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 114 transitions, 556 flow [2024-11-20 17:25:03,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 114 transitions, 526 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-20 17:25:03,692 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 244 flow [2024-11-20 17:25:03,692 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=244, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2024-11-20 17:25:03,693 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2024-11-20 17:25:03,693 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 244 flow [2024-11-20 17:25:03,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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-20 17:25:03,694 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:25:03,694 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-20 17:25:03,700 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-20 17:25:03,894 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-20 17:25:03,895 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:25:03,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:25:03,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1229040925, now seen corresponding path program 1 times [2024-11-20 17:25:03,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:25:03,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487572879] [2024-11-20 17:25:03,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:25:03,896 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-20 17:25:03,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:25:03,899 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-20 17:25:03,900 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-20 17:25:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:25:03,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 17:25:03,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:25:04,075 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-20 17:25:04,075 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:25:04,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:25:04,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487572879] [2024-11-20 17:25:04,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487572879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:25:04,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:25:04,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 17:25:04,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217132608] [2024-11-20 17:25:04,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:25:04,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 17:25:04,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:25:04,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 17:25:04,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:25:04,085 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-20 17:25:04,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 244 flow. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 0 states have call successors, (0), 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-20 17:25:04,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:25:04,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-20 17:25:04,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:25:04,663 INFO L124 PetriNetUnfolderBase]: 2927/4287 cut-off events. [2024-11-20 17:25:04,663 INFO L125 PetriNetUnfolderBase]: For 5022/5022 co-relation queries the response was YES. [2024-11-20 17:25:04,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11810 conditions, 4287 events. 2927/4287 cut-off events. For 5022/5022 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 22156 event pairs, 231 based on Foata normal form. 96/4223 useless extension candidates. Maximal degree in co-relation 11795. Up to 1316 conditions per place. [2024-11-20 17:25:04,690 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 73 selfloop transitions, 18 changer transitions 1/109 dead transitions. [2024-11-20 17:25:04,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 109 transitions, 546 flow [2024-11-20 17:25:04,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 17:25:04,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-20 17:25:04,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 241 transitions. [2024-11-20 17:25:04,692 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625974025974026 [2024-11-20 17:25:04,692 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 244 flow. Second operand 7 states and 241 transitions. [2024-11-20 17:25:04,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 109 transitions, 546 flow [2024-11-20 17:25:04,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 109 transitions, 500 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-20 17:25:04,729 INFO L231 Difference]: Finished difference. Result has 70 places, 58 transitions, 254 flow [2024-11-20 17:25:04,729 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=254, PETRI_PLACES=70, PETRI_TRANSITIONS=58} [2024-11-20 17:25:04,730 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2024-11-20 17:25:04,730 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 58 transitions, 254 flow [2024-11-20 17:25:04,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 0 states have call successors, (0), 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-20 17:25:04,730 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:25:04,731 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, 1, 1] [2024-11-20 17:25:04,736 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-20 17:25:04,931 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-20 17:25:04,932 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:25:04,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:25:04,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1140909812, now seen corresponding path program 1 times [2024-11-20 17:25:04,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:25:04,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679270677] [2024-11-20 17:25:04,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:25:04,933 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-20 17:25:04,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:25:04,934 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-20 17:25:04,935 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-20 17:25:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:25:05,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:25:05,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:25:05,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-20 17:25:05,108 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:25:05,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:25:05,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679270677] [2024-11-20 17:25:05,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679270677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:25:05,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:25:05,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:25:05,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493428806] [2024-11-20 17:25:05,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:25:05,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:25:05,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:25:05,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:25:05,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:25:05,112 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-11-20 17:25:05,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-20 17:25:05,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:25:05,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-11-20 17:25:05,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:25:05,370 INFO L124 PetriNetUnfolderBase]: 1435/2573 cut-off events. [2024-11-20 17:25:05,371 INFO L125 PetriNetUnfolderBase]: For 1126/1211 co-relation queries the response was YES. [2024-11-20 17:25:05,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5767 conditions, 2573 events. 1435/2573 cut-off events. For 1126/1211 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15981 event pairs, 1313 based on Foata normal form. 16/2379 useless extension candidates. Maximal degree in co-relation 5751. Up to 1956 conditions per place. [2024-11-20 17:25:05,392 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 22 selfloop transitions, 1 changer transitions 1/57 dead transitions. [2024-11-20 17:25:05,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 57 transitions, 300 flow [2024-11-20 17:25:05,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:25:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:25:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-11-20 17:25:05,394 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-11-20 17:25:05,394 INFO L175 Difference]: Start difference. First operand has 70 places, 58 transitions, 254 flow. Second operand 3 states and 100 transitions. [2024-11-20 17:25:05,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 57 transitions, 300 flow [2024-11-20 17:25:05,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 57 transitions, 204 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-11-20 17:25:05,402 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 156 flow [2024-11-20 17:25:05,403 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2024-11-20 17:25:05,403 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2024-11-20 17:25:05,404 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 156 flow [2024-11-20 17:25:05,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-20 17:25:05,404 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:25:05,404 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, 1, 1] [2024-11-20 17:25:05,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-20 17:25:05,605 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-20 17:25:05,605 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:25:05,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:25:05,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1140911191, now seen corresponding path program 1 times [2024-11-20 17:25:05,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:25:05,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230918120] [2024-11-20 17:25:05,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:25:05,607 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-20 17:25:05,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:25:05,610 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-20 17:25:05,611 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-20 17:25:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:25:05,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-20 17:25:05,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:25:06,278 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-20 17:25:06,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:25:06,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:25:06,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230918120] [2024-11-20 17:25:06,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230918120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:25:06,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:25:06,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 17:25:06,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776055627] [2024-11-20 17:25:06,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:25:06,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 17:25:06,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:25:06,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 17:25:06,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:25:06,296 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-11-20 17:25:06,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 156 flow. Second operand has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 0 states have call successors, (0), 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-20 17:25:06,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:25:06,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-11-20 17:25:06,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:25:06,806 INFO L124 PetriNetUnfolderBase]: 2149/3532 cut-off events. [2024-11-20 17:25:06,806 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:25:06,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7062 conditions, 3532 events. 2149/3532 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 21410 event pairs, 519 based on Foata normal form. 16/3341 useless extension candidates. Maximal degree in co-relation 7055. Up to 1087 conditions per place. [2024-11-20 17:25:06,830 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 56 selfloop transitions, 5 changer transitions 16/109 dead transitions. [2024-11-20 17:25:06,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 109 transitions, 428 flow [2024-11-20 17:25:06,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 17:25:06,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-20 17:25:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 303 transitions. [2024-11-20 17:25:06,832 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6121212121212121 [2024-11-20 17:25:06,832 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 156 flow. Second operand 9 states and 303 transitions. [2024-11-20 17:25:06,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 109 transitions, 428 flow [2024-11-20 17:25:06,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 109 transitions, 427 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:25:06,835 INFO L231 Difference]: Finished difference. Result has 71 places, 57 transitions, 178 flow [2024-11-20 17:25:06,836 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=178, PETRI_PLACES=71, PETRI_TRANSITIONS=57} [2024-11-20 17:25:06,836 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 9 predicate places. [2024-11-20 17:25:06,836 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 57 transitions, 178 flow [2024-11-20 17:25:06,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 0 states have call successors, (0), 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-20 17:25:06,837 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:25:06,837 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, 1, 1] [2024-11-20 17:25:06,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-20 17:25:07,041 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-20 17:25:07,042 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:25:07,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:25:07,043 INFO L85 PathProgramCache]: Analyzing trace with hash 692126473, now seen corresponding path program 2 times [2024-11-20 17:25:07,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:25:07,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924371077] [2024-11-20 17:25:07,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:25:07,044 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-20 17:25:07,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:25:07,045 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-20 17:25:07,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-20 17:25:07,153 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 17:25:07,153 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:25:07,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:25:07,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:25:07,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-20 17:25:07,207 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:25:07,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:25:07,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924371077] [2024-11-20 17:25:07,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924371077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:25:07,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:25:07,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:25:07,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107832029] [2024-11-20 17:25:07,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:25:07,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:25:07,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:25:07,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:25:07,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:25:07,223 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-11-20 17:25:07,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 57 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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-20 17:25:07,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:25:07,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-11-20 17:25:07,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:25:08,083 INFO L124 PetriNetUnfolderBase]: 4446/7359 cut-off events. [2024-11-20 17:25:08,083 INFO L125 PetriNetUnfolderBase]: For 1260/1260 co-relation queries the response was YES. [2024-11-20 17:25:08,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15535 conditions, 7359 events. 4446/7359 cut-off events. For 1260/1260 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 51395 event pairs, 1659 based on Foata normal form. 16/6986 useless extension candidates. Maximal degree in co-relation 15523. Up to 2947 conditions per place. [2024-11-20 17:25:08,116 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 33 selfloop transitions, 2 changer transitions 19/84 dead transitions. [2024-11-20 17:25:08,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 84 transitions, 359 flow [2024-11-20 17:25:08,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:25:08,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:25:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2024-11-20 17:25:08,118 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.610909090909091 [2024-11-20 17:25:08,119 INFO L175 Difference]: Start difference. First operand has 71 places, 57 transitions, 178 flow. Second operand 5 states and 168 transitions. [2024-11-20 17:25:08,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 84 transitions, 359 flow [2024-11-20 17:25:08,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 84 transitions, 339 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-11-20 17:25:08,126 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 173 flow [2024-11-20 17:25:08,127 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2024-11-20 17:25:08,128 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2024-11-20 17:25:08,128 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 173 flow [2024-11-20 17:25:08,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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-20 17:25:08,131 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:25:08,131 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, 1, 1] [2024-11-20 17:25:08,137 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-20 17:25:08,332 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-20 17:25:08,333 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:25:08,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:25:08,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1295719697, now seen corresponding path program 3 times [2024-11-20 17:25:08,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:25:08,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289916422] [2024-11-20 17:25:08,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 17:25:08,334 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-20 17:25:08,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:25:08,338 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-20 17:25:08,339 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-20 17:25:08,469 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-20 17:25:08,469 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:25:08,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:25:08,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:25:08,542 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-20 17:25:08,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:25:08,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:25:08,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289916422] [2024-11-20 17:25:08,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289916422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:25:08,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:25:08,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:25:08,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176032096] [2024-11-20 17:25:08,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:25:08,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:25:08,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:25:08,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:25:08,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:25:08,556 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-11-20 17:25:08,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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-20 17:25:08,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:25:08,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-11-20 17:25:08,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:25:09,275 INFO L124 PetriNetUnfolderBase]: 3350/5622 cut-off events. [2024-11-20 17:25:09,275 INFO L125 PetriNetUnfolderBase]: For 247/286 co-relation queries the response was YES. [2024-11-20 17:25:09,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11775 conditions, 5622 events. 3350/5622 cut-off events. For 247/286 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 36981 event pairs, 1603 based on Foata normal form. 16/5228 useless extension candidates. Maximal degree in co-relation 11764. Up to 2525 conditions per place. [2024-11-20 17:25:09,311 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 39 selfloop transitions, 2 changer transitions 14/85 dead transitions. [2024-11-20 17:25:09,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 85 transitions, 357 flow [2024-11-20 17:25:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:25:09,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:25:09,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2024-11-20 17:25:09,314 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6218181818181818 [2024-11-20 17:25:09,314 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 173 flow. Second operand 5 states and 171 transitions. [2024-11-20 17:25:09,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 85 transitions, 357 flow [2024-11-20 17:25:09,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 85 transitions, 339 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-20 17:25:09,319 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 177 flow [2024-11-20 17:25:09,319 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2024-11-20 17:25:09,320 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2024-11-20 17:25:09,320 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 177 flow [2024-11-20 17:25:09,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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-20 17:25:09,321 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:25:09,321 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, 1, 1] [2024-11-20 17:25:09,327 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-20 17:25:09,522 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-20 17:25:09,522 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:25:09,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:25:09,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1543733821, now seen corresponding path program 4 times [2024-11-20 17:25:09,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:25:09,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451674660] [2024-11-20 17:25:09,523 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-20 17:25:09,523 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-20 17:25:09,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:25:09,525 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-20 17:25:09,526 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-20 17:25:09,627 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-20 17:25:09,628 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:25:09,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:25:09,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:25:09,674 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-20 17:25:09,674 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:25:09,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:25:09,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451674660] [2024-11-20 17:25:09,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451674660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:25:09,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:25:09,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:25:09,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261098804] [2024-11-20 17:25:09,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:25:09,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:25:09,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:25:09,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:25:09,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:25:09,689 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-11-20 17:25:09,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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-20 17:25:09,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:25:09,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-11-20 17:25:09,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:25:10,675 INFO L124 PetriNetUnfolderBase]: 5713/9608 cut-off events. [2024-11-20 17:25:10,675 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2024-11-20 17:25:10,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19477 conditions, 9608 events. 5713/9608 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 69321 event pairs, 2281 based on Foata normal form. 16/8963 useless extension candidates. Maximal degree in co-relation 19466. Up to 3891 conditions per place. [2024-11-20 17:25:10,699 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 31 selfloop transitions, 2 changer transitions 21/85 dead transitions. [2024-11-20 17:25:10,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 85 transitions, 353 flow [2024-11-20 17:25:10,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:25:10,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:25:10,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2024-11-20 17:25:10,701 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-11-20 17:25:10,701 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 177 flow. Second operand 5 states and 170 transitions. [2024-11-20 17:25:10,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 85 transitions, 353 flow [2024-11-20 17:25:10,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 85 transitions, 345 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-20 17:25:10,704 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 183 flow [2024-11-20 17:25:10,705 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2024-11-20 17:25:10,706 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2024-11-20 17:25:10,707 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 183 flow [2024-11-20 17:25:10,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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-20 17:25:10,707 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:25:10,707 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, 1, 1] [2024-11-20 17:25:10,713 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-20 17:25:10,911 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-20 17:25:10,911 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-20 17:25:10,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:25:10,912 INFO L85 PathProgramCache]: Analyzing trace with hash -852618979, now seen corresponding path program 5 times [2024-11-20 17:25:10,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:25:10,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246196699] [2024-11-20 17:25:10,912 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 17:25:10,912 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-20 17:25:10,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:25:10,914 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-20 17:25:10,914 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-20 17:25:11,008 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 17:25:11,008 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-20 17:25:11,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 17:25:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:25:11,130 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-20 17:25:11,130 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 17:25:11,133 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-20 17:25:11,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-20 17:25:11,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-20 17:25:11,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-20 17:25:11,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-20 17:25:11,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-20 17:25:11,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-20 17:25:11,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-20 17:25:11,142 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-20 17:25:11,340 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-20 17:25:11,341 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2024-11-20 17:25:11,448 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 17:25:11,448 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 17:25:11,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:25:11 BasicIcfg [2024-11-20 17:25:11,457 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 17:25:11,457 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 17:25:11,457 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 17:25:11,458 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 17:25:11,458 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:24:56" (3/4) ... [2024-11-20 17:25:11,460 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 17:25:11,461 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 17:25:11,461 INFO L158 Benchmark]: Toolchain (without parser) took 16850.16ms. Allocated memory was 60.8MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 40.8MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 209.9MB. Max. memory is 16.1GB. [2024-11-20 17:25:11,462 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 50.3MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:25:11,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 631.12ms. Allocated memory is still 60.8MB. Free memory was 40.6MB in the beginning and 28.2MB in the end (delta: 12.3MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-11-20 17:25:11,462 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.22ms. Allocated memory is still 60.8MB. Free memory was 28.2MB in the beginning and 25.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 17:25:11,462 INFO L158 Benchmark]: Boogie Preprocessor took 101.46ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 25.6MB in the beginning and 50.3MB in the end (delta: -24.7MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-11-20 17:25:11,463 INFO L158 Benchmark]: RCFGBuilder took 872.50ms. Allocated memory is still 73.4MB. Free memory was 50.3MB in the beginning and 43.8MB in the end (delta: 6.5MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-11-20 17:25:11,463 INFO L158 Benchmark]: TraceAbstraction took 15158.01ms. Allocated memory was 73.4MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 43.2MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 200.0MB. Max. memory is 16.1GB. [2024-11-20 17:25:11,463 INFO L158 Benchmark]: Witness Printer took 3.59ms. Allocated memory is still 2.1GB. Free memory is still 1.8GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:25:11,465 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 50.3MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 631.12ms. Allocated memory is still 60.8MB. Free memory was 40.6MB in the beginning and 28.2MB in the end (delta: 12.3MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.22ms. Allocated memory is still 60.8MB. Free memory was 28.2MB in the beginning and 25.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.46ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 25.6MB in the beginning and 50.3MB in the end (delta: -24.7MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * RCFGBuilder took 872.50ms. Allocated memory is still 73.4MB. Free memory was 50.3MB in the beginning and 43.8MB in the end (delta: 6.5MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15158.01ms. Allocated memory was 73.4MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 43.2MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 200.0MB. Max. memory is 16.1GB. * Witness Printer took 3.59ms. Allocated memory is still 2.1GB. Free memory is still 1.8GB. 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_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool b$flush_delayed; [L720] 0 int b$mem_tmp; [L721] 0 _Bool b$r_buff0_thd0; [L722] 0 _Bool b$r_buff0_thd1; [L723] 0 _Bool b$r_buff0_thd2; [L724] 0 _Bool b$r_buff0_thd3; [L725] 0 _Bool b$r_buff0_thd4; [L726] 0 _Bool b$r_buff1_thd0; [L727] 0 _Bool b$r_buff1_thd1; [L728] 0 _Bool b$r_buff1_thd2; [L729] 0 _Bool b$r_buff1_thd3; [L730] 0 _Bool b$r_buff1_thd4; [L731] 0 _Bool b$read_delayed; [L732] 0 int *b$read_delayed_var; [L733] 0 int b$w_buff0; [L734] 0 _Bool b$w_buff0_used; [L735] 0 int b$w_buff1; [L736] 0 _Bool b$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L867] 0 pthread_t t1249; [L868] FCALL, FORK 0 pthread_create(&t1249, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1249=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 b$w_buff1 = b$w_buff0 [L751] 1 b$w_buff0 = 1 [L752] 1 b$w_buff1_used = b$w_buff0_used [L753] 1 b$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L755] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L756] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L757] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L758] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L759] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L760] 1 b$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L869] 0 pthread_t t1250; [L870] FCALL, FORK 0 pthread_create(&t1250, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1249=0, t1250=1, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L871] 0 pthread_t t1251; [L872] FCALL, FORK 0 pthread_create(&t1251, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1249=0, t1250=1, t1251=2, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L873] 0 pthread_t t1252; [L783] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L787] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L788] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L789] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L790] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L800] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L803] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L806] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L807] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L808] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L809] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L810] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L874] FCALL, FORK 0 pthread_create(&t1252, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1249=0, t1250=1, t1251=2, t1252=3, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L820] 4 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L823] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L826] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L829] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 4 b$flush_delayed = weak$$choice2 [L832] 4 b$mem_tmp = b [L833] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L834] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L835] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L836] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L837] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L839] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 __unbuffered_p3_EBX = b [L841] 4 b = b$flush_delayed ? b$mem_tmp : b [L842] 4 b$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L845] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L846] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L847] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L848] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L849] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L773] 1 __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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1249=0, t1250=1, t1251=2, t1252=3, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L878] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L878] RET 0 assume_abort_if_not(main$tmp_guard0) [L880] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L881] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L882] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L883] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L884] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1249=0, t1250=1, t1251=2, t1252=3, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1249=0, t1250=1, t1251=2, t1252=3, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L889] 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L17] 0 __assert_fail ("0", "mix047_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] - 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: 865]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 872]: 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: 870]: 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: 868]: 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: 874]: 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, 89 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: 14.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 564 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 542 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1747 IncrementalHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 9 mSDtfsCounter, 1747 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=5, InterpolantAutomatonStates: 52, 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.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 336 NumberOfCodeBlocks, 335 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 1046 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1265 ConjunctsInSsa, 57 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-20 17:25:11,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample