./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix038_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 cb908a7f9df60a2a419557a30ba61167baea262647e714e35178f644d31e1055 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:54:50,509 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:54:50,588 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:54:50,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:54:50,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:54:50,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:54:50,613 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:54:50,613 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:54:50,613 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:54:50,614 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:54:50,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:54:50,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:54:50,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:54:50,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:54:50,615 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:54:50,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:54:50,616 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:54:50,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:54:50,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:54:50,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:54:50,617 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:54:50,619 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:54:50,619 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:54:50,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:54:50,620 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:54:50,620 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:54:50,620 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:54:50,620 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:54:50,620 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:54:50,620 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:54:50,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:54:50,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:54:50,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:54:50,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:54:50,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:54:50,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:54:50,621 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:54:50,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:54:50,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:54:50,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:54:50,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:54:50,622 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:54:50,622 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 -> cb908a7f9df60a2a419557a30ba61167baea262647e714e35178f644d31e1055 [2024-11-10 17:54:50,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:54:50,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:54:50,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:54:50,822 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:54:50,822 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:54:50,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2024-11-10 17:54:52,006 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:54:52,199 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:54:52,199 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2024-11-10 17:54:52,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ec5dfeda/a6a23737efa846f288f8451e7f2c276a/FLAG56df7e178 [2024-11-10 17:54:52,221 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ec5dfeda/a6a23737efa846f288f8451e7f2c276a [2024-11-10 17:54:52,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:54:52,224 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:54:52,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:54:52,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:54:52,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:54:52,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:54:52" (1/1) ... [2024-11-10 17:54:52,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@464d06dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52, skipping insertion in model container [2024-11-10 17:54:52,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:54:52" (1/1) ... [2024-11-10 17:54:52,267 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:54:52,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:54:52,591 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:54:52,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:54:52,677 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:54:52,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52 WrapperNode [2024-11-10 17:54:52,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:54:52,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:54:52,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:54:52,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:54:52,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52" (1/1) ... [2024-11-10 17:54:52,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52" (1/1) ... [2024-11-10 17:54:52,730 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 121 [2024-11-10 17:54:52,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:54:52,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:54:52,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:54:52,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:54:52,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52" (1/1) ... [2024-11-10 17:54:52,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52" (1/1) ... [2024-11-10 17:54:52,746 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52" (1/1) ... [2024-11-10 17:54:52,770 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 17:54:52,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52" (1/1) ... [2024-11-10 17:54:52,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52" (1/1) ... [2024-11-10 17:54:52,780 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52" (1/1) ... [2024-11-10 17:54:52,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52" (1/1) ... [2024-11-10 17:54:52,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52" (1/1) ... [2024-11-10 17:54:52,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52" (1/1) ... [2024-11-10 17:54:52,788 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:54:52,789 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:54:52,789 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:54:52,789 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:54:52,790 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52" (1/1) ... [2024-11-10 17:54:52,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:54:52,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:54:52,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 17:54:52,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 17:54:52,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 17:54:52,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:54:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-10 17:54:52,855 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-10 17:54:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-10 17:54:52,855 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-10 17:54:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-10 17:54:52,855 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-10 17:54:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 17:54:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 17:54:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:54:52,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:54:52,857 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 17:54:52,953 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:54:52,955 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:54:53,178 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 17:54:53,178 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:54:53,336 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:54:53,337 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:54:53,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:54:53 BoogieIcfgContainer [2024-11-10 17:54:53,337 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:54:53,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:54:53,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:54:53,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:54:53,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:54:52" (1/3) ... [2024-11-10 17:54:53,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33dddf5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:54:53, skipping insertion in model container [2024-11-10 17:54:53,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52" (2/3) ... [2024-11-10 17:54:53,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33dddf5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:54:53, skipping insertion in model container [2024-11-10 17:54:53,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:54:53" (3/3) ... [2024-11-10 17:54:53,346 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc_pso.oepc_rmo.oepc.i [2024-11-10 17:54:53,359 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:54:53,359 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-10 17:54:53,361 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 17:54:53,425 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 17:54:53,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 104 flow [2024-11-10 17:54:53,470 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2024-11-10 17:54:53,472 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:54:53,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 2/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-11-10 17:54:53,476 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 46 transitions, 104 flow [2024-11-10 17:54:53,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 95 flow [2024-11-10 17:54:53,489 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:54:53,495 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;@68eacebd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:54:53,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 17:54:53,498 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 17:54:53,499 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-10 17:54:53,499 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:54:53,499 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:53,499 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-10 17:54:53,500 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:53,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:53,505 INFO L85 PathProgramCache]: Analyzing trace with hash 11989168, now seen corresponding path program 1 times [2024-11-10 17:54:53,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:54:53,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640112322] [2024-11-10 17:54:53,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:53,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:54:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:53,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:54:53,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:54:53,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640112322] [2024-11-10 17:54:53,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640112322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:53,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:53,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:54:53,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125106598] [2024-11-10 17:54:53,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:53,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:54:53,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:54:53,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:54:53,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:54:53,902 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-10 17:54:53,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:54:53,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:53,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-10 17:54:53,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:54,885 INFO L124 PetriNetUnfolderBase]: 7163/10288 cut-off events. [2024-11-10 17:54:54,886 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-10 17:54:54,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20507 conditions, 10288 events. 7163/10288 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 59478 event pairs, 783 based on Foata normal form. 570/10851 useless extension candidates. Maximal degree in co-relation 20496. Up to 8851 conditions per place. [2024-11-10 17:54:54,940 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 53 selfloop transitions, 2 changer transitions 2/64 dead transitions. [2024-11-10 17:54:54,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 257 flow [2024-11-10 17:54:54,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:54:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:54:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-11-10 17:54:54,949 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-10 17:54:54,950 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 95 flow. Second operand 3 states and 92 transitions. [2024-11-10 17:54:54,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 257 flow [2024-11-10 17:54:54,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 252 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 17:54:54,954 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 86 flow [2024-11-10 17:54:54,956 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-11-10 17:54:54,959 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2024-11-10 17:54:54,960 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 86 flow [2024-11-10 17:54:54,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:54:54,960 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:54,960 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:54:54,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 17:54:54,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:54,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:54,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1711766908, now seen corresponding path program 1 times [2024-11-10 17:54:54,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:54:54,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488570348] [2024-11-10 17:54:54,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:54,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:54:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:54:55,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:54:55,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488570348] [2024-11-10 17:54:55,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488570348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:55,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:55,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:54:55,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335224847] [2024-11-10 17:54:55,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:55,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:54:55,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:54:55,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:54:55,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:54:55,030 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 17:54:55,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:54:55,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:55,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 17:54:55,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:55,704 INFO L124 PetriNetUnfolderBase]: 6431/9839 cut-off events. [2024-11-10 17:54:55,705 INFO L125 PetriNetUnfolderBase]: For 446/446 co-relation queries the response was YES. [2024-11-10 17:54:55,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19483 conditions, 9839 events. 6431/9839 cut-off events. For 446/446 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 58805 event pairs, 6431 based on Foata normal form. 288/10086 useless extension candidates. Maximal degree in co-relation 19473. Up to 9108 conditions per place. [2024-11-10 17:54:55,752 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 29 selfloop transitions, 1 changer transitions 1/37 dead transitions. [2024-11-10 17:54:55,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 146 flow [2024-11-10 17:54:55,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:54:55,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:54:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2024-11-10 17:54:55,755 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.427536231884058 [2024-11-10 17:54:55,755 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 86 flow. Second operand 3 states and 59 transitions. [2024-11-10 17:54:55,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 146 flow [2024-11-10 17:54:55,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 17:54:55,757 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 80 flow [2024-11-10 17:54:55,757 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-10 17:54:55,757 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2024-11-10 17:54:55,757 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 80 flow [2024-11-10 17:54:55,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:54:55,758 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:55,758 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:54:55,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 17:54:55,759 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:55,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:55,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1711766569, now seen corresponding path program 1 times [2024-11-10 17:54:55,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:54:55,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022303664] [2024-11-10 17:54:55,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:55,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:54:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:55,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:54:55,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:54:55,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022303664] [2024-11-10 17:54:55,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022303664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:55,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:55,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:54:55,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973010216] [2024-11-10 17:54:55,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:55,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:54:55,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:54:55,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:54:55,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:54:55,999 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 17:54:55,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:54:56,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:56,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 17:54:56,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:56,949 INFO L124 PetriNetUnfolderBase]: 7295/10775 cut-off events. [2024-11-10 17:54:56,949 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:54:56,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21269 conditions, 10775 events. 7295/10775 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 60918 event pairs, 1715 based on Foata normal form. 0/10590 useless extension candidates. Maximal degree in co-relation 21263. Up to 4993 conditions per place. [2024-11-10 17:54:56,976 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 42 selfloop transitions, 2 changer transitions 74/123 dead transitions. [2024-11-10 17:54:56,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 123 transitions, 490 flow [2024-11-10 17:54:56,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 17:54:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 17:54:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2024-11-10 17:54:56,978 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2024-11-10 17:54:56,978 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 80 flow. Second operand 8 states and 192 transitions. [2024-11-10 17:54:56,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 123 transitions, 490 flow [2024-11-10 17:54:56,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 123 transitions, 489 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 17:54:56,981 INFO L231 Difference]: Finished difference. Result has 56 places, 35 transitions, 93 flow [2024-11-10 17:54:56,982 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=93, PETRI_PLACES=56, PETRI_TRANSITIONS=35} [2024-11-10 17:54:56,982 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2024-11-10 17:54:56,982 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 35 transitions, 93 flow [2024-11-10 17:54:56,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:54:56,983 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:56,983 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:54:56,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 17:54:56,983 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:56,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:56,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1741346643, now seen corresponding path program 1 times [2024-11-10 17:54:56,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:54:56,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115373375] [2024-11-10 17:54:56,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:56,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:54:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:54:57,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:54:57,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115373375] [2024-11-10 17:54:57,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115373375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:57,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:57,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 17:54:57,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326210158] [2024-11-10 17:54:57,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:57,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:54:57,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:54:57,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:54:57,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:54:57,137 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 17:54:57,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 35 transitions, 93 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:54:57,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:57,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 17:54:57,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:58,356 INFO L124 PetriNetUnfolderBase]: 8705/12917 cut-off events. [2024-11-10 17:54:58,356 INFO L125 PetriNetUnfolderBase]: For 2532/2532 co-relation queries the response was YES. [2024-11-10 17:54:58,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28157 conditions, 12917 events. 8705/12917 cut-off events. For 2532/2532 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 77961 event pairs, 495 based on Foata normal form. 296/13211 useless extension candidates. Maximal degree in co-relation 28145. Up to 6717 conditions per place. [2024-11-10 17:54:58,411 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 63 selfloop transitions, 8 changer transitions 71/147 dead transitions. [2024-11-10 17:54:58,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 147 transitions, 637 flow [2024-11-10 17:54:58,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:54:58,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 17:54:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 235 transitions. [2024-11-10 17:54:58,414 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914 [2024-11-10 17:54:58,414 INFO L175 Difference]: Start difference. First operand has 56 places, 35 transitions, 93 flow. Second operand 10 states and 235 transitions. [2024-11-10 17:54:58,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 147 transitions, 637 flow [2024-11-10 17:54:58,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 147 transitions, 601 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-11-10 17:54:58,544 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 151 flow [2024-11-10 17:54:58,544 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=151, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2024-11-10 17:54:58,545 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2024-11-10 17:54:58,545 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 151 flow [2024-11-10 17:54:58,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:54:58,545 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:58,545 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:54:58,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 17:54:58,546 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:58,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:58,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2036124188, now seen corresponding path program 1 times [2024-11-10 17:54:58,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:54:58,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401562986] [2024-11-10 17:54:58,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:58,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:54:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:54:58,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:54:58,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401562986] [2024-11-10 17:54:58,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401562986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:58,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:58,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:54:58,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477680851] [2024-11-10 17:54:58,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:58,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:54:58,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:54:58,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:54:58,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:54:58,659 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-10 17:54:58,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 41 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:54:58,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:58,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-10 17:54:58,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:59,346 INFO L124 PetriNetUnfolderBase]: 6393/9881 cut-off events. [2024-11-10 17:54:59,346 INFO L125 PetriNetUnfolderBase]: For 5630/5633 co-relation queries the response was YES. [2024-11-10 17:54:59,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24811 conditions, 9881 events. 6393/9881 cut-off events. For 5630/5633 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 58945 event pairs, 1122 based on Foata normal form. 468/10347 useless extension candidates. Maximal degree in co-relation 24795. Up to 5052 conditions per place. [2024-11-10 17:54:59,396 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 79 selfloop transitions, 5 changer transitions 1/90 dead transitions. [2024-11-10 17:54:59,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 503 flow [2024-11-10 17:54:59,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:54:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 17:54:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-11-10 17:54:59,397 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.592391304347826 [2024-11-10 17:54:59,398 INFO L175 Difference]: Start difference. First operand has 61 places, 41 transitions, 151 flow. Second operand 4 states and 109 transitions. [2024-11-10 17:54:59,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 503 flow [2024-11-10 17:54:59,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 90 transitions, 495 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-10 17:54:59,418 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 177 flow [2024-11-10 17:54:59,418 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-11-10 17:54:59,419 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2024-11-10 17:54:59,419 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 177 flow [2024-11-10 17:54:59,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:54:59,420 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:59,420 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] [2024-11-10 17:54:59,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 17:54:59,420 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:59,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:59,421 INFO L85 PathProgramCache]: Analyzing trace with hash 580601515, now seen corresponding path program 1 times [2024-11-10 17:54:59,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:54:59,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980114867] [2024-11-10 17:54:59,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:59,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:54:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:54:59,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:54:59,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980114867] [2024-11-10 17:54:59,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980114867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:59,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:59,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:54:59,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058374736] [2024-11-10 17:54:59,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:59,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:54:59,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:54:59,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:54:59,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:54:59,608 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 17:54:59,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:54:59,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:59,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 17:54:59,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:55:00,490 INFO L124 PetriNetUnfolderBase]: 7770/11746 cut-off events. [2024-11-10 17:55:00,490 INFO L125 PetriNetUnfolderBase]: For 7402/7405 co-relation queries the response was YES. [2024-11-10 17:55:00,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32553 conditions, 11746 events. 7770/11746 cut-off events. For 7402/7405 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 69197 event pairs, 2613 based on Foata normal form. 168/11912 useless extension candidates. Maximal degree in co-relation 32537. Up to 5988 conditions per place. [2024-11-10 17:55:00,532 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 64 selfloop transitions, 8 changer transitions 52/129 dead transitions. [2024-11-10 17:55:00,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 129 transitions, 741 flow [2024-11-10 17:55:00,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 17:55:00,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 17:55:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2024-11-10 17:55:00,534 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5081521739130435 [2024-11-10 17:55:00,534 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 177 flow. Second operand 8 states and 187 transitions. [2024-11-10 17:55:00,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 129 transitions, 741 flow [2024-11-10 17:55:00,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 129 transitions, 726 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-10 17:55:00,539 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 224 flow [2024-11-10 17:55:00,540 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=224, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2024-11-10 17:55:00,540 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2024-11-10 17:55:00,540 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 224 flow [2024-11-10 17:55:00,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:55:00,541 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:55:00,541 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] [2024-11-10 17:55:00,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 17:55:00,541 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:55:00,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:55:00,541 INFO L85 PathProgramCache]: Analyzing trace with hash 353490812, now seen corresponding path program 1 times [2024-11-10 17:55:00,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:55:00,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451448368] [2024-11-10 17:55:00,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:55:00,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:55:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:55:00,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:55:00,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:55:00,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451448368] [2024-11-10 17:55:00,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451448368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:55:00,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:55:00,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 17:55:00,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690675721] [2024-11-10 17:55:00,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:55:00,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:55:00,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:55:00,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:55:00,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:55:00,699 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 17:55:00,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:55:00,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:55:00,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 17:55:00,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:55:02,046 INFO L124 PetriNetUnfolderBase]: 12010/18178 cut-off events. [2024-11-10 17:55:02,046 INFO L125 PetriNetUnfolderBase]: For 16812/16818 co-relation queries the response was YES. [2024-11-10 17:55:02,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50243 conditions, 18178 events. 12010/18178 cut-off events. For 16812/16818 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 115065 event pairs, 1579 based on Foata normal form. 185/18357 useless extension candidates. Maximal degree in co-relation 50221. Up to 6836 conditions per place. [2024-11-10 17:55:02,115 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 89 selfloop transitions, 14 changer transitions 47/155 dead transitions. [2024-11-10 17:55:02,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 155 transitions, 943 flow [2024-11-10 17:55:02,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 17:55:02,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 17:55:02,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2024-11-10 17:55:02,116 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5461956521739131 [2024-11-10 17:55:02,116 INFO L175 Difference]: Start difference. First operand has 67 places, 47 transitions, 224 flow. Second operand 8 states and 201 transitions. [2024-11-10 17:55:02,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 155 transitions, 943 flow [2024-11-10 17:55:02,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 155 transitions, 913 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-11-10 17:55:02,266 INFO L231 Difference]: Finished difference. Result has 71 places, 52 transitions, 303 flow [2024-11-10 17:55:02,267 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=303, PETRI_PLACES=71, PETRI_TRANSITIONS=52} [2024-11-10 17:55:02,268 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2024-11-10 17:55:02,268 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 52 transitions, 303 flow [2024-11-10 17:55:02,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:55:02,268 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:55:02,268 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] [2024-11-10 17:55:02,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 17:55:02,268 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:55:02,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:55:02,269 INFO L85 PathProgramCache]: Analyzing trace with hash -320094114, now seen corresponding path program 2 times [2024-11-10 17:55:02,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:55:02,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657530022] [2024-11-10 17:55:02,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:55:02,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:55:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:55:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:55:02,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:55:02,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657530022] [2024-11-10 17:55:02,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657530022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:55:02,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:55:02,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:55:02,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16150053] [2024-11-10 17:55:02,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:55:02,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:55:02,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:55:02,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:55:02,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:55:02,385 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-10 17:55:02,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 52 transitions, 303 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:55:02,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:55:02,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-10 17:55:02,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:55:03,432 INFO L124 PetriNetUnfolderBase]: 7066/11038 cut-off events. [2024-11-10 17:55:03,432 INFO L125 PetriNetUnfolderBase]: For 13909/13915 co-relation queries the response was YES. [2024-11-10 17:55:03,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30442 conditions, 11038 events. 7066/11038 cut-off events. For 13909/13915 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 68135 event pairs, 1018 based on Foata normal form. 711/11747 useless extension candidates. Maximal degree in co-relation 30417. Up to 3641 conditions per place. [2024-11-10 17:55:03,479 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 91 selfloop transitions, 8 changer transitions 22/126 dead transitions. [2024-11-10 17:55:03,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 126 transitions, 977 flow [2024-11-10 17:55:03,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:55:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 17:55:03,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2024-11-10 17:55:03,481 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6043478260869565 [2024-11-10 17:55:03,481 INFO L175 Difference]: Start difference. First operand has 71 places, 52 transitions, 303 flow. Second operand 5 states and 139 transitions. [2024-11-10 17:55:03,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 126 transitions, 977 flow [2024-11-10 17:55:03,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 126 transitions, 963 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-10 17:55:03,500 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 303 flow [2024-11-10 17:55:03,500 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=303, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2024-11-10 17:55:03,500 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 21 predicate places. [2024-11-10 17:55:03,501 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 303 flow [2024-11-10 17:55:03,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:55:03,501 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:55:03,501 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:55:03,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 17:55:03,502 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:55:03,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:55:03,502 INFO L85 PathProgramCache]: Analyzing trace with hash 382568784, now seen corresponding path program 1 times [2024-11-10 17:55:03,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:55:03,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21606859] [2024-11-10 17:55:03,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:55:03,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:55:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:55:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:55:03,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:55:03,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21606859] [2024-11-10 17:55:03,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21606859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:55:03,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:55:03,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 17:55:03,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269195127] [2024-11-10 17:55:03,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:55:03,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:55:03,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:55:03,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:55:03,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:55:03,739 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-10 17:55:03,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 303 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:55:03,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:55:03,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-10 17:55:03,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:55:04,198 INFO L124 PetriNetUnfolderBase]: 3709/5799 cut-off events. [2024-11-10 17:55:04,198 INFO L125 PetriNetUnfolderBase]: For 10823/10826 co-relation queries the response was YES. [2024-11-10 17:55:04,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18209 conditions, 5799 events. 3709/5799 cut-off events. For 10823/10826 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 32383 event pairs, 697 based on Foata normal form. 244/6041 useless extension candidates. Maximal degree in co-relation 18183. Up to 2066 conditions per place. [2024-11-10 17:55:04,218 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 59 selfloop transitions, 11 changer transitions 27/102 dead transitions. [2024-11-10 17:55:04,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 102 transitions, 759 flow [2024-11-10 17:55:04,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:55:04,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 17:55:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2024-11-10 17:55:04,219 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5036231884057971 [2024-11-10 17:55:04,219 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 303 flow. Second operand 6 states and 139 transitions. [2024-11-10 17:55:04,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 102 transitions, 759 flow [2024-11-10 17:55:04,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 102 transitions, 713 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-11-10 17:55:04,257 INFO L231 Difference]: Finished difference. Result has 73 places, 41 transitions, 214 flow [2024-11-10 17:55:04,257 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=73, PETRI_TRANSITIONS=41} [2024-11-10 17:55:04,257 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2024-11-10 17:55:04,258 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 41 transitions, 214 flow [2024-11-10 17:55:04,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:55:04,258 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:55:04,258 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-10 17:55:04,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 17:55:04,258 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:55:04,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:55:04,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1870996334, now seen corresponding path program 1 times [2024-11-10 17:55:04,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:55:04,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175324014] [2024-11-10 17:55:04,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:55:04,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:55:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:55:05,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:55:05,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:55:05,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175324014] [2024-11-10 17:55:05,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175324014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:55:05,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:55:05,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 17:55:05,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285529294] [2024-11-10 17:55:05,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:55:05,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 17:55:05,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:55:05,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 17:55:05,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 17:55:05,106 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 17:55:05,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 41 transitions, 214 flow. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:55:05,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:55:05,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 17:55:05,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:55:05,555 INFO L124 PetriNetUnfolderBase]: 977/1601 cut-off events. [2024-11-10 17:55:05,555 INFO L125 PetriNetUnfolderBase]: For 1884/1884 co-relation queries the response was YES. [2024-11-10 17:55:05,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4772 conditions, 1601 events. 977/1601 cut-off events. For 1884/1884 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6639 event pairs, 220 based on Foata normal form. 8/1609 useless extension candidates. Maximal degree in co-relation 4747. Up to 826 conditions per place. [2024-11-10 17:55:05,560 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 51 selfloop transitions, 5 changer transitions 42/103 dead transitions. [2024-11-10 17:55:05,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 103 transitions, 677 flow [2024-11-10 17:55:05,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:55:05,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 17:55:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-11-10 17:55:05,562 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3804347826086957 [2024-11-10 17:55:05,562 INFO L175 Difference]: Start difference. First operand has 73 places, 41 transitions, 214 flow. Second operand 10 states and 175 transitions. [2024-11-10 17:55:05,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 103 transitions, 677 flow [2024-11-10 17:55:05,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 103 transitions, 491 flow, removed 40 selfloop flow, removed 19 redundant places. [2024-11-10 17:55:05,569 INFO L231 Difference]: Finished difference. Result has 65 places, 41 transitions, 144 flow [2024-11-10 17:55:05,570 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=144, PETRI_PLACES=65, PETRI_TRANSITIONS=41} [2024-11-10 17:55:05,571 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2024-11-10 17:55:05,572 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 41 transitions, 144 flow [2024-11-10 17:55:05,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:55:05,572 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:55:05,572 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-10 17:55:05,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 17:55:05,572 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:55:05,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:55:05,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1423790244, now seen corresponding path program 2 times [2024-11-10 17:55:05,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:55:05,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060265142] [2024-11-10 17:55:05,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:55:05,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:55:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 17:55:05,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 17:55:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 17:55:05,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 17:55:05,731 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 17:55:05,732 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-10 17:55:05,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-10 17:55:05,735 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-10 17:55:05,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-10 17:55:05,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-10 17:55:05,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-10 17:55:05,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-10 17:55:05,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 17:55:05,737 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:55:05,812 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 17:55:05,813 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 17:55:05,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:55:05 BasicIcfg [2024-11-10 17:55:05,816 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 17:55:05,817 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 17:55:05,817 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 17:55:05,817 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 17:55:05,818 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:54:53" (3/4) ... [2024-11-10 17:55:05,819 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 17:55:05,820 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 17:55:05,820 INFO L158 Benchmark]: Toolchain (without parser) took 13596.68ms. Allocated memory was 159.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 91.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 648.8MB. Max. memory is 16.1GB. [2024-11-10 17:55:05,820 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 109.1MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:55:05,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.82ms. Allocated memory is still 159.4MB. Free memory was 91.7MB in the beginning and 118.7MB in the end (delta: -27.0MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2024-11-10 17:55:05,821 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.52ms. Allocated memory is still 159.4MB. Free memory was 118.7MB in the beginning and 116.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 17:55:05,821 INFO L158 Benchmark]: Boogie Preprocessor took 55.55ms. Allocated memory is still 159.4MB. Free memory was 116.0MB in the beginning and 112.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 17:55:05,821 INFO L158 Benchmark]: IcfgBuilder took 548.65ms. Allocated memory is still 159.4MB. Free memory was 112.4MB in the beginning and 54.5MB in the end (delta: 57.9MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-11-10 17:55:05,821 INFO L158 Benchmark]: TraceAbstraction took 12477.09ms. Allocated memory was 159.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 53.7MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 610.1MB. Max. memory is 16.1GB. [2024-11-10 17:55:05,822 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 1.9GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:55:05,823 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.09ms. Allocated memory is still 109.1MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 452.82ms. Allocated memory is still 159.4MB. Free memory was 91.7MB in the beginning and 118.7MB in the end (delta: -27.0MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.52ms. Allocated memory is still 159.4MB. Free memory was 118.7MB in the beginning and 116.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.55ms. Allocated memory is still 159.4MB. Free memory was 116.0MB in the beginning and 112.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 548.65ms. Allocated memory is still 159.4MB. Free memory was 112.4MB in the beginning and 54.5MB in the end (delta: 57.9MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12477.09ms. Allocated memory was 159.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 53.7MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 610.1MB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 1.9GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1001; [L844] FCALL, FORK 0 pthread_create(&t1001, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1001=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1002; [L846] FCALL, FORK 0 pthread_create(&t1002, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1001=-2, t1002=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1003; [L848] FCALL, FORK 0 pthread_create(&t1003, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1001=-2, t1002=-1, t1003=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L796] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L799] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1001=-2, t1002=-1, t1003=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1001=-2, t1002=-1, t1003=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1001=-2, t1002=-1, t1003=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix038_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 844]: 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: 846]: 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: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 72 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 785 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 782 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1822 IncrementalHoareTripleChecker+Invalid, 1867 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 3 mSDtfsCounter, 1822 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=7, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 1130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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-10 17:55:05,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix038_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 cb908a7f9df60a2a419557a30ba61167baea262647e714e35178f644d31e1055 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:55:07,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:55:07,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 17:55:07,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:55:07,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:55:07,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:55:07,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:55:07,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:55:07,908 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:55:07,910 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:55:07,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:55:07,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:55:07,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:55:07,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:55:07,912 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:55:07,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:55:07,913 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:55:07,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:55:07,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:55:07,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:55:07,914 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:55:07,914 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:55:07,914 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:55:07,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:55:07,915 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:55:07,915 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 17:55:07,915 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:55:07,915 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 17:55:07,915 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:55:07,916 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:55:07,916 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:55:07,916 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:55:07,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:55:07,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:55:07,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:55:07,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:55:07,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:55:07,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:55:07,918 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 17:55:07,918 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 17:55:07,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:55:07,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:55:07,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:55:07,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:55:07,919 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 -> cb908a7f9df60a2a419557a30ba61167baea262647e714e35178f644d31e1055 [2024-11-10 17:55:08,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:55:08,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:55:08,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:55:08,191 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:55:08,191 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:55:08,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2024-11-10 17:55:09,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:55:09,685 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:55:09,686 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2024-11-10 17:55:09,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae9876b53/75a737b75f7843dc8b5e9dcf55384d1d/FLAGfe2ff301d [2024-11-10 17:55:10,052 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae9876b53/75a737b75f7843dc8b5e9dcf55384d1d [2024-11-10 17:55:10,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:55:10,055 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:55:10,056 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:55:10,056 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:55:10,060 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:55:10,060 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:55:10" (1/1) ... [2024-11-10 17:55:10,061 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@247a14c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:10, skipping insertion in model container [2024-11-10 17:55:10,061 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:55:10" (1/1) ... [2024-11-10 17:55:10,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:55:10,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:55:10,435 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:55:10,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:55:10,530 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:55:10,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:10 WrapperNode [2024-11-10 17:55:10,531 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:55:10,532 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:55:10,532 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:55:10,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:55:10,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:10" (1/1) ... [2024-11-10 17:55:10,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:10" (1/1) ... [2024-11-10 17:55:10,590 INFO L138 Inliner]: procedures = 176, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 122 [2024-11-10 17:55:10,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:55:10,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:55:10,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:55:10,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:55:10,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:10" (1/1) ... [2024-11-10 17:55:10,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:10" (1/1) ... [2024-11-10 17:55:10,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:10" (1/1) ... [2024-11-10 17:55:10,628 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 17:55:10,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:10" (1/1) ... [2024-11-10 17:55:10,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:10" (1/1) ... [2024-11-10 17:55:10,650 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:10" (1/1) ... [2024-11-10 17:55:10,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:10" (1/1) ... [2024-11-10 17:55:10,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:10" (1/1) ... [2024-11-10 17:55:10,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:10" (1/1) ... [2024-11-10 17:55:10,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:55:10,663 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:55:10,663 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:55:10,663 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:55:10,663 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:10" (1/1) ... [2024-11-10 17:55:10,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:55:10,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:55:10,692 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 17:55:10,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 17:55:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 17:55:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:55:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 17:55:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-10 17:55:10,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-10 17:55:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-10 17:55:10,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-10 17:55:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-10 17:55:10,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-10 17:55:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 17:55:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:55:10,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:55:10,735 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 17:55:10,858 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:55:10,860 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:55:11,139 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 17:55:11,139 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:55:11,335 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:55:11,336 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:55:11,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:55:11 BoogieIcfgContainer [2024-11-10 17:55:11,336 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:55:11,338 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:55:11,338 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:55:11,340 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:55:11,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:55:10" (1/3) ... [2024-11-10 17:55:11,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eeb4f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:55:11, skipping insertion in model container [2024-11-10 17:55:11,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:10" (2/3) ... [2024-11-10 17:55:11,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eeb4f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:55:11, skipping insertion in model container [2024-11-10 17:55:11,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:55:11" (3/3) ... [2024-11-10 17:55:11,343 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc_pso.oepc_rmo.oepc.i [2024-11-10 17:55:11,355 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:55:11,356 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-10 17:55:11,356 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 17:55:11,397 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 17:55:11,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 104 flow [2024-11-10 17:55:11,451 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2024-11-10 17:55:11,451 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:55:11,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 2/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-11-10 17:55:11,456 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 46 transitions, 104 flow [2024-11-10 17:55:11,460 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 95 flow [2024-11-10 17:55:11,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:55:11,472 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;@1e617caa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:55:11,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 17:55:11,475 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 17:55:11,475 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-10 17:55:11,476 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:55:11,476 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:55:11,476 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-10 17:55:11,476 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:55:11,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:55:11,481 INFO L85 PathProgramCache]: Analyzing trace with hash 12050736, now seen corresponding path program 1 times [2024-11-10 17:55:11,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:55:11,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484562890] [2024-11-10 17:55:11,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:55:11,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:55:11,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:55:11,494 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:55:11,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 17:55:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:55:11,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 17:55:11,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:55:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:55:11,609 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:55:11,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:55:11,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484562890] [2024-11-10 17:55:11,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484562890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:55:11,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:55:11,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:55:11,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478683760] [2024-11-10 17:55:11,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:55:11,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:55:11,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:55:11,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:55:11,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:55:11,644 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-10 17:55:11,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:55:11,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:55:11,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-10 17:55:11,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:55:12,594 INFO L124 PetriNetUnfolderBase]: 7163/10288 cut-off events. [2024-11-10 17:55:12,595 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-10 17:55:12,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20507 conditions, 10288 events. 7163/10288 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 59466 event pairs, 783 based on Foata normal form. 570/10851 useless extension candidates. Maximal degree in co-relation 20496. Up to 8851 conditions per place. [2024-11-10 17:55:12,640 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 53 selfloop transitions, 2 changer transitions 2/64 dead transitions. [2024-11-10 17:55:12,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 257 flow [2024-11-10 17:55:12,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:55:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:55:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-11-10 17:55:12,648 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-10 17:55:12,650 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 95 flow. Second operand 3 states and 92 transitions. [2024-11-10 17:55:12,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 257 flow [2024-11-10 17:55:12,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 252 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 17:55:12,654 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 86 flow [2024-11-10 17:55:12,655 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-11-10 17:55:12,659 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2024-11-10 17:55:12,659 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 86 flow [2024-11-10 17:55:12,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:55:12,659 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:55:12,659 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:55:12,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 17:55:12,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:55:12,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:55:12,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:55:12,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1976502470, now seen corresponding path program 1 times [2024-11-10 17:55:12,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:55:12,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253513845] [2024-11-10 17:55:12,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:55:12,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:55:12,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:55:12,866 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:55:12,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 17:55:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:55:12,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:55:12,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:55:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:55:12,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:55:12,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:55:12,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253513845] [2024-11-10 17:55:12,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253513845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:55:12,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:55:12,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:55:12,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324998215] [2024-11-10 17:55:12,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:55:12,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:55:12,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:55:12,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:55:12,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:55:12,992 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-10 17:55:12,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:55:12,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:55:12,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-10 17:55:12,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:55:13,656 INFO L124 PetriNetUnfolderBase]: 4955/8027 cut-off events. [2024-11-10 17:55:13,656 INFO L125 PetriNetUnfolderBase]: For 326/326 co-relation queries the response was YES. [2024-11-10 17:55:13,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15691 conditions, 8027 events. 4955/8027 cut-off events. For 326/326 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 50490 event pairs, 755 based on Foata normal form. 288/8312 useless extension candidates. Maximal degree in co-relation 15681. Up to 4453 conditions per place. [2024-11-10 17:55:13,683 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 62 selfloop transitions, 5 changer transitions 1/75 dead transitions. [2024-11-10 17:55:13,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 304 flow [2024-11-10 17:55:13,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:55:13,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 17:55:13,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2024-11-10 17:55:13,684 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5978260869565217 [2024-11-10 17:55:13,685 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 86 flow. Second operand 4 states and 110 transitions. [2024-11-10 17:55:13,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 304 flow [2024-11-10 17:55:13,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 17:55:13,687 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 116 flow [2024-11-10 17:55:13,688 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2024-11-10 17:55:13,688 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2024-11-10 17:55:13,688 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 116 flow [2024-11-10 17:55:13,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:55:13,689 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:55:13,689 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:55:13,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 17:55:13,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:55:13,890 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:55:13,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:55:13,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1404074696, now seen corresponding path program 1 times [2024-11-10 17:55:13,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:55:13,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561595293] [2024-11-10 17:55:13,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:55:13,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:55:13,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:55:13,893 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:55:13,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 17:55:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:55:13,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:55:13,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:55:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:55:13,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:55:13,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:55:13,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561595293] [2024-11-10 17:55:13,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561595293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:55:13,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:55:13,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:55:13,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753353021] [2024-11-10 17:55:13,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:55:13,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:55:13,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:55:13,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:55:13,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:55:13,998 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-10 17:55:13,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:55:13,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:55:13,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-10 17:55:13,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:55:14,343 INFO L124 PetriNetUnfolderBase]: 2555/4123 cut-off events. [2024-11-10 17:55:14,343 INFO L125 PetriNetUnfolderBase]: For 824/824 co-relation queries the response was YES. [2024-11-10 17:55:14,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9171 conditions, 4123 events. 2555/4123 cut-off events. For 824/824 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 22009 event pairs, 483 based on Foata normal form. 192/4312 useless extension candidates. Maximal degree in co-relation 9159. Up to 1317 conditions per place. [2024-11-10 17:55:14,357 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 79 selfloop transitions, 8 changer transitions 1/95 dead transitions. [2024-11-10 17:55:14,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 95 transitions, 421 flow [2024-11-10 17:55:14,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:55:14,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 17:55:14,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2024-11-10 17:55:14,358 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2024-11-10 17:55:14,358 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 116 flow. Second operand 5 states and 140 transitions. [2024-11-10 17:55:14,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 95 transitions, 421 flow [2024-11-10 17:55:14,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 95 transitions, 411 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-10 17:55:14,362 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 156 flow [2024-11-10 17:55:14,362 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2024-11-10 17:55:14,362 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2024-11-10 17:55:14,362 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 156 flow [2024-11-10 17:55:14,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:55:14,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:55:14,363 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:55:14,366 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-10 17:55:14,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:55:14,564 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:55:14,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:55:14,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1620982371, now seen corresponding path program 1 times [2024-11-10 17:55:14,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:55:14,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700655300] [2024-11-10 17:55:14,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:55:14,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:55:14,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:55:14,567 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:55:14,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 17:55:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:55:14,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 17:55:14,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:55:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:55:14,719 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:55:14,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:55:14,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700655300] [2024-11-10 17:55:14,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700655300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:55:14,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:55:14,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 17:55:14,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385013529] [2024-11-10 17:55:14,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:55:14,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:55:14,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:55:14,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:55:14,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:55:14,721 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-10 17:55:14,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 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-10 17:55:14,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:55:14,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-10 17:55:14,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:55:15,058 INFO L124 PetriNetUnfolderBase]: 1507/2331 cut-off events. [2024-11-10 17:55:15,059 INFO L125 PetriNetUnfolderBase]: For 1490/1490 co-relation queries the response was YES. [2024-11-10 17:55:15,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5735 conditions, 2331 events. 1507/2331 cut-off events. For 1490/1490 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 10599 event pairs, 435 based on Foata normal form. 64/2392 useless extension candidates. Maximal degree in co-relation 5721. Up to 880 conditions per place. [2024-11-10 17:55:15,068 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 66 selfloop transitions, 11 changer transitions 1/85 dead transitions. [2024-11-10 17:55:15,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 85 transitions, 404 flow [2024-11-10 17:55:15,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:55:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 17:55:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2024-11-10 17:55:15,069 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2024-11-10 17:55:15,070 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 156 flow. Second operand 6 states and 140 transitions. [2024-11-10 17:55:15,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 85 transitions, 404 flow [2024-11-10 17:55:15,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 85 transitions, 379 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-10 17:55:15,078 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 170 flow [2024-11-10 17:55:15,078 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2024-11-10 17:55:15,078 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2024-11-10 17:55:15,079 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 170 flow [2024-11-10 17:55:15,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 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-10 17:55:15,079 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:55:15,079 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-10 17:55:15,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 17:55:15,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:55:15,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:55:15,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:55:15,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1328282209, now seen corresponding path program 1 times [2024-11-10 17:55:15,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:55:15,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624282947] [2024-11-10 17:55:15,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:55:15,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:55:15,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:55:15,285 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:55:15,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 17:55:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:55:15,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:55:15,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:55:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:55:15,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:55:15,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:55:15,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624282947] [2024-11-10 17:55:15,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624282947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:55:15,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:55:15,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:55:15,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696852690] [2024-11-10 17:55:15,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:55:15,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:55:15,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:55:15,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:55:15,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:55:15,407 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-10 17:55:15,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:55:15,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:55:15,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-10 17:55:15,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:55:15,606 INFO L124 PetriNetUnfolderBase]: 1391/2143 cut-off events. [2024-11-10 17:55:15,606 INFO L125 PetriNetUnfolderBase]: For 1354/1354 co-relation queries the response was YES. [2024-11-10 17:55:15,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5288 conditions, 2143 events. 1391/2143 cut-off events. For 1354/1354 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9377 event pairs, 1315 based on Foata normal form. 8/2146 useless extension candidates. Maximal degree in co-relation 5273. Up to 2108 conditions per place. [2024-11-10 17:55:15,618 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 35 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2024-11-10 17:55:15,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 43 transitions, 242 flow [2024-11-10 17:55:15,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:55:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:55:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2024-11-10 17:55:15,619 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.427536231884058 [2024-11-10 17:55:15,620 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 170 flow. Second operand 3 states and 59 transitions. [2024-11-10 17:55:15,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 43 transitions, 242 flow [2024-11-10 17:55:15,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 186 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-10 17:55:15,625 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 112 flow [2024-11-10 17:55:15,626 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2024-11-10 17:55:15,626 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2024-11-10 17:55:15,626 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 112 flow [2024-11-10 17:55:15,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:55:15,627 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:55:15,627 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-10 17:55:15,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 17:55:15,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:55:15,828 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:55:15,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:55:15,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1046282680, now seen corresponding path program 1 times [2024-11-10 17:55:15,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:55:15,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261786523] [2024-11-10 17:55:15,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:55:15,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:55:15,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:55:15,830 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:55:15,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 17:55:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:55:15,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 17:55:15,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:55:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:55:15,966 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:55:15,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:55:15,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261786523] [2024-11-10 17:55:15,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261786523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:55:15,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:55:15,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 17:55:15,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511679001] [2024-11-10 17:55:15,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:55:15,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:55:15,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:55:15,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:55:15,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:55:15,971 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-10 17:55:15,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:55:15,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:55:15,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-10 17:55:15,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:55:16,313 INFO L124 PetriNetUnfolderBase]: 2117/3269 cut-off events. [2024-11-10 17:55:16,313 INFO L125 PetriNetUnfolderBase]: For 234/234 co-relation queries the response was YES. [2024-11-10 17:55:16,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7118 conditions, 3269 events. 2117/3269 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 16277 event pairs, 951 based on Foata normal form. 8/3275 useless extension candidates. Maximal degree in co-relation 7111. Up to 1815 conditions per place. [2024-11-10 17:55:16,323 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 51 selfloop transitions, 2 changer transitions 20/79 dead transitions. [2024-11-10 17:55:16,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 355 flow [2024-11-10 17:55:16,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:55:16,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 17:55:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2024-11-10 17:55:16,324 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48695652173913045 [2024-11-10 17:55:16,324 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 112 flow. Second operand 5 states and 112 transitions. [2024-11-10 17:55:16,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 355 flow [2024-11-10 17:55:16,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 354 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 17:55:16,326 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 123 flow [2024-11-10 17:55:16,326 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-11-10 17:55:16,327 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2024-11-10 17:55:16,327 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 123 flow [2024-11-10 17:55:16,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:55:16,327 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:55:16,328 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-10 17:55:16,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-10 17:55:16,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:55:16,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:55:16,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:55:16,529 INFO L85 PathProgramCache]: Analyzing trace with hash 943196710, now seen corresponding path program 2 times [2024-11-10 17:55:16,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:55:16,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543873556] [2024-11-10 17:55:16,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 17:55:16,530 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:55:16,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:55:16,532 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:55:16,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 17:55:16,613 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 17:55:16,613 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:55:16,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:55:16,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:55:16,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:55:16,662 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:55:16,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:55:16,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543873556] [2024-11-10 17:55:16,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543873556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:55:16,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:55:16,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:55:16,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002190769] [2024-11-10 17:55:16,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:55:16,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:55:16,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:55:16,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:55:16,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:55:16,670 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-10 17:55:16,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:55:16,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:55:16,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-10 17:55:16,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:55:16,962 INFO L124 PetriNetUnfolderBase]: 1435/2267 cut-off events. [2024-11-10 17:55:16,963 INFO L125 PetriNetUnfolderBase]: For 340/342 co-relation queries the response was YES. [2024-11-10 17:55:16,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5151 conditions, 2267 events. 1435/2267 cut-off events. For 340/342 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9941 event pairs, 177 based on Foata normal form. 8/2274 useless extension candidates. Maximal degree in co-relation 5141. Up to 1170 conditions per place. [2024-11-10 17:55:16,974 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 44 selfloop transitions, 1 changer transitions 34/85 dead transitions. [2024-11-10 17:55:16,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 85 transitions, 404 flow [2024-11-10 17:55:16,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:55:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 17:55:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-11-10 17:55:16,977 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45652173913043476 [2024-11-10 17:55:16,977 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 123 flow. Second operand 6 states and 126 transitions. [2024-11-10 17:55:16,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 85 transitions, 404 flow [2024-11-10 17:55:16,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 85 transitions, 386 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-10 17:55:16,980 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 124 flow [2024-11-10 17:55:16,980 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=124, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2024-11-10 17:55:16,981 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2024-11-10 17:55:16,981 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 124 flow [2024-11-10 17:55:16,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:55:16,981 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:55:16,981 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-10 17:55:16,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-10 17:55:17,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:55:17,182 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:55:17,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:55:17,183 INFO L85 PathProgramCache]: Analyzing trace with hash 390547434, now seen corresponding path program 3 times [2024-11-10 17:55:17,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:55:17,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303896039] [2024-11-10 17:55:17,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 17:55:17,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:55:17,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:55:17,186 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:55:17,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-10 17:55:17,263 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-10 17:55:17,264 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:55:17,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 17:55:17,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:55:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:55:17,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:55:17,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:55:17,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303896039] [2024-11-10 17:55:17,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303896039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:55:17,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:55:17,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 17:55:17,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995783315] [2024-11-10 17:55:17,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:55:17,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 17:55:17,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:55:17,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 17:55:17,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 17:55:17,613 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-10 17:55:17,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 124 flow. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 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-10 17:55:17,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:55:17,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-10 17:55:17,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:55:17,980 INFO L124 PetriNetUnfolderBase]: 1191/1939 cut-off events. [2024-11-10 17:55:17,981 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2024-11-10 17:55:17,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4388 conditions, 1939 events. 1191/1939 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 8962 event pairs, 149 based on Foata normal form. 8/1947 useless extension candidates. Maximal degree in co-relation 4377. Up to 1000 conditions per place. [2024-11-10 17:55:17,988 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 49 selfloop transitions, 4 changer transitions 46/105 dead transitions. [2024-11-10 17:55:17,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 105 transitions, 499 flow [2024-11-10 17:55:17,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 17:55:17,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 17:55:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-11-10 17:55:17,990 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4251207729468599 [2024-11-10 17:55:17,990 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 124 flow. Second operand 9 states and 176 transitions. [2024-11-10 17:55:17,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 105 transitions, 499 flow [2024-11-10 17:55:17,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 105 transitions, 486 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-10 17:55:17,993 INFO L231 Difference]: Finished difference. Result has 63 places, 42 transitions, 135 flow [2024-11-10 17:55:17,994 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=135, PETRI_PLACES=63, PETRI_TRANSITIONS=42} [2024-11-10 17:55:17,995 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 12 predicate places. [2024-11-10 17:55:17,996 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 42 transitions, 135 flow [2024-11-10 17:55:17,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 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-10 17:55:17,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:55:17,997 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-10 17:55:18,000 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-10 17:55:18,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:55:18,198 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:55:18,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:55:18,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1848634716, now seen corresponding path program 4 times [2024-11-10 17:55:18,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:55:18,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021944371] [2024-11-10 17:55:18,199 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 17:55:18,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:55:18,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:55:18,202 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:55:18,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-10 17:55:18,268 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 17:55:18,268 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-10 17:55:18,268 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 17:55:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 17:55:18,362 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 17:55:18,362 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 17:55:18,363 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-10 17:55:18,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-10 17:55:18,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-10 17:55:18,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-10 17:55:18,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-10 17:55:18,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-10 17:55:18,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-10 17:55:18,369 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-10 17:55:18,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:55:18,566 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-10 17:55:18,635 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 17:55:18,635 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 17:55:18,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:55:18 BasicIcfg [2024-11-10 17:55:18,645 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 17:55:18,645 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 17:55:18,646 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 17:55:18,646 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 17:55:18,646 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:55:11" (3/4) ... [2024-11-10 17:55:18,648 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 17:55:18,649 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 17:55:18,649 INFO L158 Benchmark]: Toolchain (without parser) took 8594.39ms. Allocated memory was 75.5MB in the beginning and 933.2MB in the end (delta: 857.7MB). Free memory was 45.7MB in the beginning and 438.4MB in the end (delta: -392.7MB). Peak memory consumption was 465.8MB. Max. memory is 16.1GB. [2024-11-10 17:55:18,650 INFO L158 Benchmark]: CDTParser took 0.66ms. Allocated memory is still 56.6MB. Free memory was 41.1MB in the beginning and 41.1MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:55:18,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.76ms. Allocated memory is still 75.5MB. Free memory was 45.5MB in the beginning and 38.2MB in the end (delta: 7.3MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-11-10 17:55:18,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.72ms. Allocated memory is still 75.5MB. Free memory was 38.2MB in the beginning and 35.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 17:55:18,650 INFO L158 Benchmark]: Boogie Preprocessor took 70.22ms. Allocated memory is still 75.5MB. Free memory was 35.6MB in the beginning and 53.4MB in the end (delta: -17.8MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2024-11-10 17:55:18,650 INFO L158 Benchmark]: IcfgBuilder took 673.79ms. Allocated memory was 75.5MB in the beginning and 100.7MB in the end (delta: 25.2MB). Free memory was 53.4MB in the beginning and 57.2MB in the end (delta: -3.8MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2024-11-10 17:55:18,651 INFO L158 Benchmark]: TraceAbstraction took 7307.27ms. Allocated memory was 100.7MB in the beginning and 933.2MB in the end (delta: 832.6MB). Free memory was 56.6MB in the beginning and 438.4MB in the end (delta: -381.9MB). Peak memory consumption was 450.9MB. Max. memory is 16.1GB. [2024-11-10 17:55:18,651 INFO L158 Benchmark]: Witness Printer took 3.51ms. Allocated memory is still 933.2MB. Free memory is still 438.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:55:18,652 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.66ms. Allocated memory is still 56.6MB. Free memory was 41.1MB in the beginning and 41.1MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 474.76ms. Allocated memory is still 75.5MB. Free memory was 45.5MB in the beginning and 38.2MB in the end (delta: 7.3MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.72ms. Allocated memory is still 75.5MB. Free memory was 38.2MB in the beginning and 35.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.22ms. Allocated memory is still 75.5MB. Free memory was 35.6MB in the beginning and 53.4MB in the end (delta: -17.8MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * IcfgBuilder took 673.79ms. Allocated memory was 75.5MB in the beginning and 100.7MB in the end (delta: 25.2MB). Free memory was 53.4MB in the beginning and 57.2MB in the end (delta: -3.8MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7307.27ms. Allocated memory was 100.7MB in the beginning and 933.2MB in the end (delta: 832.6MB). Free memory was 56.6MB in the beginning and 438.4MB in the end (delta: -381.9MB). Peak memory consumption was 450.9MB. Max. memory is 16.1GB. * Witness Printer took 3.51ms. Allocated memory is still 933.2MB. Free memory is still 438.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1001; [L844] FCALL, FORK 0 pthread_create(&t1001, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1001=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1002; [L846] FCALL, FORK 0 pthread_create(&t1002, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1001=0, t1002=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1003; [L848] FCALL, FORK 0 pthread_create(&t1003, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1001=0, t1002=1, t1003=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L796] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L799] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1001=0, t1002=1, t1003=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1001=0, t1002=1, t1003=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1001=0, t1002=1, t1003=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix038_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 848]: 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: 844]: 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: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 72 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 408 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 402 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1434 IncrementalHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 4 mSDtfsCounter, 1434 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=4, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 745 SizeOfPredicates, 13 NumberOfNonLiveVariables, 886 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 17:55:18,673 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