./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix006_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 932dbff5eab91f48afae7fbaa75574114ec0af0a04ac9352bdcfc8911a65e56a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:26:11,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:26:11,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:26:11,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:26:11,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:26:11,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:26:11,604 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:26:11,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:26:11,605 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:26:11,606 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:26:11,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:26:11,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:26:11,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:26:11,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:26:11,607 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:26:11,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:26:11,608 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:26:11,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:26:11,612 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:26:11,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:26:11,615 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:26:11,616 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:26:11,616 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:26:11,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:26:11,617 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:26:11,617 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:26:11,617 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:26:11,617 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:26:11,618 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:26:11,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:26:11,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:26:11,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:26:11,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:26:11,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:26:11,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:26:11,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:26:11,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:26:11,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:26:11,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:26:11,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:26:11,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:26:11,622 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:26:11,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 -> 932dbff5eab91f48afae7fbaa75574114ec0af0a04ac9352bdcfc8911a65e56a [2024-11-09 10:26:11,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:26:11,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:26:11,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:26:11,947 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:26:11,947 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:26:11,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i [2024-11-09 10:26:13,370 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:26:13,666 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:26:13,667 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i [2024-11-09 10:26:13,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eac551e4/da9df4db177a4bc0bc9de149496e9c1e/FLAG770d0ee4b [2024-11-09 10:26:13,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eac551e4/da9df4db177a4bc0bc9de149496e9c1e [2024-11-09 10:26:13,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:26:13,961 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:26:13,962 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:26:13,962 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:26:13,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:26:13,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:26:13" (1/1) ... [2024-11-09 10:26:13,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7758648d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:13, skipping insertion in model container [2024-11-09 10:26:13,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:26:13" (1/1) ... [2024-11-09 10:26:14,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:26:14,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:26:14,450 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:26:14,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:26:14,549 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:26:14,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:14 WrapperNode [2024-11-09 10:26:14,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:26:14,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:26:14,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:26:14,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:26:14,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:14" (1/1) ... [2024-11-09 10:26:14,586 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:14" (1/1) ... [2024-11-09 10:26:14,630 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 121 [2024-11-09 10:26:14,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:26:14,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:26:14,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:26:14,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:26:14,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:14" (1/1) ... [2024-11-09 10:26:14,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:14" (1/1) ... [2024-11-09 10:26:14,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:14" (1/1) ... [2024-11-09 10:26:14,679 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 10:26:14,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:14" (1/1) ... [2024-11-09 10:26:14,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:14" (1/1) ... [2024-11-09 10:26:14,692 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:14" (1/1) ... [2024-11-09 10:26:14,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:14" (1/1) ... [2024-11-09 10:26:14,695 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:14" (1/1) ... [2024-11-09 10:26:14,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:14" (1/1) ... [2024-11-09 10:26:14,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:26:14,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:26:14,701 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:26:14,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:26:14,702 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:14" (1/1) ... [2024-11-09 10:26:14,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:26:14,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:26:14,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:26:14,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:26:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:26:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:26:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-09 10:26:14,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-09 10:26:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-09 10:26:14,796 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-09 10:26:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-09 10:26:14,796 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-09 10:26:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:26:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:26:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:26:14,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:26:14,799 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:26:15,042 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:26:15,044 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:26:15,360 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:26:15,360 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:26:15,588 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:26:15,589 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:26:15,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:26:15 BoogieIcfgContainer [2024-11-09 10:26:15,590 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:26:15,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:26:15,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:26:15,598 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:26:15,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:26:13" (1/3) ... [2024-11-09 10:26:15,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b975604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:26:15, skipping insertion in model container [2024-11-09 10:26:15,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:14" (2/3) ... [2024-11-09 10:26:15,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b975604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:26:15, skipping insertion in model container [2024-11-09 10:26:15,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:26:15" (3/3) ... [2024-11-09 10:26:15,602 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006_power.oepc_pso.oepc_rmo.oepc.i [2024-11-09 10:26:15,619 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:26:15,619 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 10:26:15,620 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:26:15,687 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:26:15,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 104 flow [2024-11-09 10:26:15,762 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2024-11-09 10:26:15,762 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:26:15,768 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 4. Compared 82 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-09 10:26:15,770 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 46 transitions, 104 flow [2024-11-09 10:26:15,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 95 flow [2024-11-09 10:26:15,786 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:26:15,794 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;@65d6849b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:26:15,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:26:15,798 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:26:15,798 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:26:15,799 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:26:15,799 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:15,799 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-09 10:26:15,800 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:15,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:15,806 INFO L85 PathProgramCache]: Analyzing trace with hash 12184796, now seen corresponding path program 1 times [2024-11-09 10:26:15,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:26:15,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972530909] [2024-11-09 10:26:15,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:15,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:26:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:16,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:16,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:26:16,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972530909] [2024-11-09 10:26:16,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972530909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:16,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:16,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:26:16,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238630329] [2024-11-09 10:26:16,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:16,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:26:16,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:26:16,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:26:16,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:26:16,323 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2024-11-09 10:26:16,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:16,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:16,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2024-11-09 10:26:16,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:16,844 INFO L124 PetriNetUnfolderBase]: 825/1454 cut-off events. [2024-11-09 10:26:16,845 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-09 10:26:16,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2735 conditions, 1454 events. 825/1454 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8788 event pairs, 457 based on Foata normal form. 96/1532 useless extension candidates. Maximal degree in co-relation 2724. Up to 1009 conditions per place. [2024-11-09 10:26:16,866 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 33 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2024-11-09 10:26:16,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 55 transitions, 199 flow [2024-11-09 10:26:16,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:26:16,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:26:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-11-09 10:26:16,880 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7608695652173914 [2024-11-09 10:26:16,882 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 95 flow. Second operand 3 states and 105 transitions. [2024-11-09 10:26:16,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 55 transitions, 199 flow [2024-11-09 10:26:16,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 194 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:26:16,891 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 86 flow [2024-11-09 10:26:16,895 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-09 10:26:16,901 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2024-11-09 10:26:16,901 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 86 flow [2024-11-09 10:26:16,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:16,902 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:16,902 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:16,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:26:16,902 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:16,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:16,903 INFO L85 PathProgramCache]: Analyzing trace with hash -2126398420, now seen corresponding path program 1 times [2024-11-09 10:26:16,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:26:16,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275072912] [2024-11-09 10:26:16,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:16,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:26:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:16,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:26:16,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275072912] [2024-11-09 10:26:16,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275072912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:16,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:16,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:26:16,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392718741] [2024-11-09 10:26:16,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:16,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:26:16,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:26:16,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:26:16,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:26:16,979 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 46 [2024-11-09 10:26:16,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:16,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:16,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 46 [2024-11-09 10:26:16,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:17,241 INFO L124 PetriNetUnfolderBase]: 721/1389 cut-off events. [2024-11-09 10:26:17,241 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-11-09 10:26:17,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2609 conditions, 1389 events. 721/1389 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9131 event pairs, 721 based on Foata normal form. 48/1382 useless extension candidates. Maximal degree in co-relation 2599. Up to 1090 conditions per place. [2024-11-09 10:26:17,252 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 18 selfloop transitions, 1 changer transitions 1/37 dead transitions. [2024-11-09 10:26:17,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 124 flow [2024-11-09 10:26:17,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:26:17,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:26:17,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-11-09 10:26:17,255 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5869565217391305 [2024-11-09 10:26:17,255 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 86 flow. Second operand 3 states and 81 transitions. [2024-11-09 10:26:17,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 124 flow [2024-11-09 10:26:17,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:26:17,257 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 80 flow [2024-11-09 10:26:17,259 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-09 10:26:17,260 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2024-11-09 10:26:17,260 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 80 flow [2024-11-09 10:26:17,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:17,260 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:17,261 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:17,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:26:17,261 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:17,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:17,262 INFO L85 PathProgramCache]: Analyzing trace with hash -2126396899, now seen corresponding path program 1 times [2024-11-09 10:26:17,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:26:17,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196144561] [2024-11-09 10:26:17,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:17,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:26:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:17,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:26:17,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196144561] [2024-11-09 10:26:17,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196144561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:17,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:17,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:26:17,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524108150] [2024-11-09 10:26:17,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:17,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:26:17,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:26:17,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:26:17,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:26:17,450 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-09 10:26:17,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:17,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:17,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-09 10:26:17,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:17,844 INFO L124 PetriNetUnfolderBase]: 1499/2620 cut-off events. [2024-11-09 10:26:17,844 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:26:17,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4936 conditions, 2620 events. 1499/2620 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 16699 event pairs, 188 based on Foata normal form. 100/2664 useless extension candidates. Maximal degree in co-relation 4930. Up to 1316 conditions per place. [2024-11-09 10:26:17,859 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 42 selfloop transitions, 5 changer transitions 1/61 dead transitions. [2024-11-09 10:26:17,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 230 flow [2024-11-09 10:26:17,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:26:17,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:26:17,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2024-11-09 10:26:17,863 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6413043478260869 [2024-11-09 10:26:17,864 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 80 flow. Second operand 4 states and 118 transitions. [2024-11-09 10:26:17,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 230 flow [2024-11-09 10:26:17,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:26:17,866 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 113 flow [2024-11-09 10:26:17,867 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=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-09 10:26:17,869 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2024-11-09 10:26:17,869 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 113 flow [2024-11-09 10:26:17,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:17,869 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:17,869 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-09 10:26:17,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:26:17,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:17,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:17,871 INFO L85 PathProgramCache]: Analyzing trace with hash 166550502, now seen corresponding path program 1 times [2024-11-09 10:26:17,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:26:17,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948922462] [2024-11-09 10:26:17,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:17,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:26:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:18,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:18,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:26:18,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948922462] [2024-11-09 10:26:18,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948922462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:18,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:18,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:26:18,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294758506] [2024-11-09 10:26:18,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:18,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:26:18,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:26:18,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:26:18,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:26:18,230 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-09 10:26:18,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:18,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:18,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-09 10:26:18,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:18,576 INFO L124 PetriNetUnfolderBase]: 962/1687 cut-off events. [2024-11-09 10:26:18,577 INFO L125 PetriNetUnfolderBase]: For 423/423 co-relation queries the response was YES. [2024-11-09 10:26:18,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3793 conditions, 1687 events. 962/1687 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9382 event pairs, 100 based on Foata normal form. 82/1724 useless extension candidates. Maximal degree in co-relation 3784. Up to 581 conditions per place. [2024-11-09 10:26:18,587 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 53 selfloop transitions, 8 changer transitions 1/75 dead transitions. [2024-11-09 10:26:18,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 75 transitions, 330 flow [2024-11-09 10:26:18,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:26:18,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:26:18,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2024-11-09 10:26:18,589 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6478260869565218 [2024-11-09 10:26:18,589 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 113 flow. Second operand 5 states and 149 transitions. [2024-11-09 10:26:18,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 75 transitions, 330 flow [2024-11-09 10:26:18,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 75 transitions, 320 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 10:26:18,593 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 153 flow [2024-11-09 10:26:18,593 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2024-11-09 10:26:18,594 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2024-11-09 10:26:18,594 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 153 flow [2024-11-09 10:26:18,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:18,594 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:18,595 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:18,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:26:18,595 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:18,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:18,599 INFO L85 PathProgramCache]: Analyzing trace with hash -412763029, now seen corresponding path program 1 times [2024-11-09 10:26:18,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:26:18,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047712063] [2024-11-09 10:26:18,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:18,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:26:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:18,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:18,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:26:18,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047712063] [2024-11-09 10:26:18,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047712063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:18,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:18,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:26:18,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237773335] [2024-11-09 10:26:18,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:18,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:26:18,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:26:18,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:26:18,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:26:18,893 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-09 10:26:18,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:18,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:18,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-09 10:26:18,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:19,196 INFO L124 PetriNetUnfolderBase]: 569/964 cut-off events. [2024-11-09 10:26:19,197 INFO L125 PetriNetUnfolderBase]: For 756/756 co-relation queries the response was YES. [2024-11-09 10:26:19,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2479 conditions, 964 events. 569/964 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4408 event pairs, 83 based on Foata normal form. 40/964 useless extension candidates. Maximal degree in co-relation 2468. Up to 308 conditions per place. [2024-11-09 10:26:19,202 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 46 selfloop transitions, 11 changer transitions 1/71 dead transitions. [2024-11-09 10:26:19,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 337 flow [2024-11-09 10:26:19,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:26:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:26:19,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2024-11-09 10:26:19,203 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5869565217391305 [2024-11-09 10:26:19,203 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 153 flow. Second operand 6 states and 162 transitions. [2024-11-09 10:26:19,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 337 flow [2024-11-09 10:26:19,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 71 transitions, 312 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-09 10:26:19,209 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 167 flow [2024-11-09 10:26:19,209 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2024-11-09 10:26:19,210 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2024-11-09 10:26:19,210 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 167 flow [2024-11-09 10:26:19,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:19,210 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:19,211 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:19,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:26:19,211 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:19,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:19,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1608465948, now seen corresponding path program 1 times [2024-11-09 10:26:19,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:26:19,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385243939] [2024-11-09 10:26:19,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:19,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:26:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:20,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:20,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:26:20,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385243939] [2024-11-09 10:26:20,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385243939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:20,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:20,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:26:20,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287798821] [2024-11-09 10:26:20,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:20,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 10:26:20,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:26:20,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 10:26:20,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 10:26:20,599 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 46 [2024-11-09 10:26:20,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 167 flow. Second operand has 9 states, 9 states have (on average 21.88888888888889) internal successors, (197), 9 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:20,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:20,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 46 [2024-11-09 10:26:20,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:21,105 INFO L124 PetriNetUnfolderBase]: 455/873 cut-off events. [2024-11-09 10:26:21,106 INFO L125 PetriNetUnfolderBase]: For 529/543 co-relation queries the response was YES. [2024-11-09 10:26:21,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2108 conditions, 873 events. 455/873 cut-off events. For 529/543 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4448 event pairs, 102 based on Foata normal form. 8/837 useless extension candidates. Maximal degree in co-relation 2096. Up to 236 conditions per place. [2024-11-09 10:26:21,112 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 32 selfloop transitions, 4 changer transitions 24/82 dead transitions. [2024-11-09 10:26:21,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 82 transitions, 383 flow [2024-11-09 10:26:21,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:26:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 10:26:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 241 transitions. [2024-11-09 10:26:21,114 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5821256038647343 [2024-11-09 10:26:21,114 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 167 flow. Second operand 9 states and 241 transitions. [2024-11-09 10:26:21,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 82 transitions, 383 flow [2024-11-09 10:26:21,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 82 transitions, 319 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-09 10:26:21,119 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 129 flow [2024-11-09 10:26:21,120 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=129, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2024-11-09 10:26:21,120 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2024-11-09 10:26:21,121 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 129 flow [2024-11-09 10:26:21,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.88888888888889) internal successors, (197), 9 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:21,121 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:21,122 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:21,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:26:21,122 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:21,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:21,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2009759724, now seen corresponding path program 2 times [2024-11-09 10:26:21,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:26:21,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018983174] [2024-11-09 10:26:21,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:21,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:26:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:21,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:26:21,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018983174] [2024-11-09 10:26:21,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018983174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:21,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:21,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:26:21,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821650278] [2024-11-09 10:26:21,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:21,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:26:21,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:26:21,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:26:21,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:26:21,470 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-09 10:26:21,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 42 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:21,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:21,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-09 10:26:21,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:21,735 INFO L124 PetriNetUnfolderBase]: 694/1343 cut-off events. [2024-11-09 10:26:21,735 INFO L125 PetriNetUnfolderBase]: For 219/227 co-relation queries the response was YES. [2024-11-09 10:26:21,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2877 conditions, 1343 events. 694/1343 cut-off events. For 219/227 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7734 event pairs, 321 based on Foata normal form. 8/1268 useless extension candidates. Maximal degree in co-relation 2865. Up to 605 conditions per place. [2024-11-09 10:26:21,744 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 30 selfloop transitions, 2 changer transitions 13/65 dead transitions. [2024-11-09 10:26:21,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 281 flow [2024-11-09 10:26:21,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:26:21,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:26:21,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-11-09 10:26:21,745 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.591304347826087 [2024-11-09 10:26:21,746 INFO L175 Difference]: Start difference. First operand has 60 places, 42 transitions, 129 flow. Second operand 5 states and 136 transitions. [2024-11-09 10:26:21,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 281 flow [2024-11-09 10:26:21,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 65 transitions, 259 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-11-09 10:26:21,749 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 127 flow [2024-11-09 10:26:21,750 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=49, 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=127, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2024-11-09 10:26:21,751 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2024-11-09 10:26:21,753 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 127 flow [2024-11-09 10:26:21,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:21,753 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:21,753 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:21,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:26:21,754 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:21,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:21,754 INFO L85 PathProgramCache]: Analyzing trace with hash 2009313116, now seen corresponding path program 3 times [2024-11-09 10:26:21,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:26:21,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991884547] [2024-11-09 10:26:21,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:21,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:26:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:22,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:22,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:26:22,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991884547] [2024-11-09 10:26:22,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991884547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:22,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:22,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:26:22,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750855558] [2024-11-09 10:26:22,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:22,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:26:22,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:26:22,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:26:22,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:26:22,104 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-09 10:26:22,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 127 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:22,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:22,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-09 10:26:22,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:22,371 INFO L124 PetriNetUnfolderBase]: 550/1088 cut-off events. [2024-11-09 10:26:22,371 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2024-11-09 10:26:22,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2216 conditions, 1088 events. 550/1088 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5709 event pairs, 187 based on Foata normal form. 8/1047 useless extension candidates. Maximal degree in co-relation 2205. Up to 405 conditions per place. [2024-11-09 10:26:22,376 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 24 selfloop transitions, 1 changer transitions 22/67 dead transitions. [2024-11-09 10:26:22,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 67 transitions, 280 flow [2024-11-09 10:26:22,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:26:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:26:22,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2024-11-09 10:26:22,378 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2024-11-09 10:26:22,378 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 127 flow. Second operand 6 states and 156 transitions. [2024-11-09 10:26:22,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 67 transitions, 280 flow [2024-11-09 10:26:22,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 67 transitions, 266 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 10:26:22,380 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 128 flow [2024-11-09 10:26:22,381 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=50, 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=128, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2024-11-09 10:26:22,381 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2024-11-09 10:26:22,381 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 128 flow [2024-11-09 10:26:22,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:22,382 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:22,382 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:22,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:26:22,382 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:22,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:22,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1496896376, now seen corresponding path program 4 times [2024-11-09 10:26:22,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:26:22,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101065096] [2024-11-09 10:26:22,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:22,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:26:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:26:22,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:26:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:26:22,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:26:22,598 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:26:22,599 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-09 10:26:22,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-09 10:26:22,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-09 10:26:22,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-09 10:26:22,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-09 10:26:22,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-09 10:26:22,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:26:22,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:26:22,603 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-09 10:26:22,708 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:26:22,709 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:26:22,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:26:22 BasicIcfg [2024-11-09 10:26:22,715 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:26:22,716 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:26:22,716 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:26:22,716 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:26:22,717 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:26:15" (3/4) ... [2024-11-09 10:26:22,719 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:26:22,720 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:26:22,721 INFO L158 Benchmark]: Toolchain (without parser) took 8759.62ms. Allocated memory was 163.6MB in the beginning and 295.7MB in the end (delta: 132.1MB). Free memory was 130.8MB in the beginning and 219.7MB in the end (delta: -88.8MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2024-11-09 10:26:22,721 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:26:22,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 588.39ms. Allocated memory is still 163.6MB. Free memory was 129.8MB in the beginning and 103.9MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 10:26:22,722 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.89ms. Allocated memory is still 163.6MB. Free memory was 103.9MB in the beginning and 101.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:26:22,722 INFO L158 Benchmark]: Boogie Preprocessor took 68.05ms. Allocated memory is still 163.6MB. Free memory was 101.8MB in the beginning and 97.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:26:22,723 INFO L158 Benchmark]: RCFGBuilder took 889.81ms. Allocated memory is still 163.6MB. Free memory was 97.6MB in the beginning and 82.4MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 10:26:22,723 INFO L158 Benchmark]: TraceAbstraction took 7121.67ms. Allocated memory was 163.6MB in the beginning and 295.7MB in the end (delta: 132.1MB). Free memory was 81.4MB in the beginning and 220.7MB in the end (delta: -139.3MB). Peak memory consumption was 129.0MB. Max. memory is 16.1GB. [2024-11-09 10:26:22,724 INFO L158 Benchmark]: Witness Printer took 4.19ms. Allocated memory is still 295.7MB. Free memory was 220.7MB in the beginning and 219.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:26:22,729 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.18ms. Allocated memory is still 109.1MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 588.39ms. Allocated memory is still 163.6MB. Free memory was 129.8MB in the beginning and 103.9MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.89ms. Allocated memory is still 163.6MB. Free memory was 103.9MB in the beginning and 101.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.05ms. Allocated memory is still 163.6MB. Free memory was 101.8MB in the beginning and 97.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 889.81ms. Allocated memory is still 163.6MB. Free memory was 97.6MB in the beginning and 82.4MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7121.67ms. Allocated memory was 163.6MB in the beginning and 295.7MB in the end (delta: 132.1MB). Free memory was 81.4MB in the beginning and 220.7MB in the end (delta: -139.3MB). Peak memory consumption was 129.0MB. Max. memory is 16.1GB. * Witness Printer took 4.19ms. Allocated memory is still 295.7MB. Free memory was 220.7MB in the beginning and 219.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t153; [L844] FCALL, FORK 0 pthread_create(&t153, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t153=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L845] 0 pthread_t t154; [L846] FCALL, FORK 0 pthread_create(&t154, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t153=-2, t154=-1, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 0 pthread_t t155; [L848] FCALL, FORK 0 pthread_create(&t155, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t153=-2, t154=-1, t155=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L786] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L787] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L789] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L799] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 z$flush_delayed = weak$$choice2 [L808] 3 z$mem_tmp = z [L809] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L810] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L811] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L812] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L813] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L815] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = z [L817] 3 z = z$flush_delayed ? z$mem_tmp : z [L818] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t153=-2, t154=-1, t155=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t153=-2, t154=-1, t155=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t153=-2, t154=-1, t155=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix006_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=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 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: 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: 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: 6.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 343 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 321 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 866 IncrementalHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 15 mSDtfsCounter, 866 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=5, 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.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 637 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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-09 10:26:22,769 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/mix006_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 932dbff5eab91f48afae7fbaa75574114ec0af0a04ac9352bdcfc8911a65e56a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:26:25,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:26:25,136 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:26:25,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:26:25,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:26:25,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:26:25,161 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:26:25,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:26:25,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:26:25,163 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:26:25,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:26:25,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:26:25,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:26:25,165 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:26:25,165 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:26:25,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:26:25,166 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:26:25,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:26:25,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:26:25,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:26:25,167 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:26:25,168 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:26:25,168 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:26:25,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:26:25,169 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:26:25,169 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:26:25,170 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:26:25,170 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:26:25,171 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:26:25,171 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:26:25,171 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:26:25,172 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:26:25,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:26:25,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:26:25,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:26:25,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:26:25,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:26:25,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:26:25,174 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:26:25,174 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:26:25,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:26:25,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:26:25,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:26:25,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:26:25,176 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 -> 932dbff5eab91f48afae7fbaa75574114ec0af0a04ac9352bdcfc8911a65e56a [2024-11-09 10:26:25,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:26:25,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:26:25,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:26:25,570 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:26:25,571 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:26:25,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i [2024-11-09 10:26:27,092 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:26:27,368 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:26:27,370 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i [2024-11-09 10:26:27,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c9b8fb43/0b118e3e902a4eebb6bba727c05cee09/FLAG1d7a57491 [2024-11-09 10:26:27,415 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c9b8fb43/0b118e3e902a4eebb6bba727c05cee09 [2024-11-09 10:26:27,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:26:27,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:26:27,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:26:27,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:26:27,430 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:26:27,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:26:27" (1/1) ... [2024-11-09 10:26:27,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702dbf68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:27, skipping insertion in model container [2024-11-09 10:26:27,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:26:27" (1/1) ... [2024-11-09 10:26:27,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:26:27,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:26:27,953 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:26:28,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:26:28,045 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:26:28,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:28 WrapperNode [2024-11-09 10:26:28,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:26:28,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:26:28,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:26:28,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:26:28,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:28" (1/1) ... [2024-11-09 10:26:28,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:28" (1/1) ... [2024-11-09 10:26:28,104 INFO L138 Inliner]: procedures = 176, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 122 [2024-11-09 10:26:28,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:26:28,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:26:28,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:26:28,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:26:28,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:28" (1/1) ... [2024-11-09 10:26:28,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:28" (1/1) ... [2024-11-09 10:26:28,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:28" (1/1) ... [2024-11-09 10:26:28,134 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 10:26:28,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:28" (1/1) ... [2024-11-09 10:26:28,135 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:28" (1/1) ... [2024-11-09 10:26:28,149 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:28" (1/1) ... [2024-11-09 10:26:28,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:28" (1/1) ... [2024-11-09 10:26:28,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:28" (1/1) ... [2024-11-09 10:26:28,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:28" (1/1) ... [2024-11-09 10:26:28,172 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:26:28,173 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:26:28,173 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:26:28,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:26:28,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:28" (1/1) ... [2024-11-09 10:26:28,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:26:28,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:26:28,207 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:26:28,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:26:28,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:26:28,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:26:28,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:26:28,242 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-09 10:26:28,242 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-09 10:26:28,242 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-09 10:26:28,242 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-09 10:26:28,242 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-09 10:26:28,242 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-09 10:26:28,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:26:28,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:26:28,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:26:28,244 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:26:28,429 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:26:28,431 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:26:28,781 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:26:28,781 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:26:29,077 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:26:29,078 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:26:29,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:26:29 BoogieIcfgContainer [2024-11-09 10:26:29,079 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:26:29,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:26:29,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:26:29,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:26:29,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:26:27" (1/3) ... [2024-11-09 10:26:29,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d94f877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:26:29, skipping insertion in model container [2024-11-09 10:26:29,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:28" (2/3) ... [2024-11-09 10:26:29,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d94f877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:26:29, skipping insertion in model container [2024-11-09 10:26:29,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:26:29" (3/3) ... [2024-11-09 10:26:29,090 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006_power.oepc_pso.oepc_rmo.oepc.i [2024-11-09 10:26:29,107 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:26:29,107 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 10:26:29,107 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:26:29,186 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:26:29,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 104 flow [2024-11-09 10:26:29,261 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2024-11-09 10:26:29,262 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:26:29,267 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 4. Compared 82 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-09 10:26:29,269 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 46 transitions, 104 flow [2024-11-09 10:26:29,274 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 95 flow [2024-11-09 10:26:29,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:26:29,294 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;@1552af1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:26:29,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:26:29,300 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:26:29,301 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:26:29,301 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:26:29,301 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:29,302 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-09 10:26:29,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:29,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:29,309 INFO L85 PathProgramCache]: Analyzing trace with hash 12246364, now seen corresponding path program 1 times [2024-11-09 10:26:29,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:26:29,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575735338] [2024-11-09 10:26:29,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:29,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:26:29,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:26:29,325 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:26:29,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 10:26:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:29,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:26:29,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:26:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:29,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:26:29,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:26:29,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575735338] [2024-11-09 10:26:29,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575735338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:29,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:29,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:26:29,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009358722] [2024-11-09 10:26:29,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:29,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:26:29,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:26:29,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:26:29,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:26:29,516 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2024-11-09 10:26:29,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:29,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:29,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2024-11-09 10:26:29,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:29,950 INFO L124 PetriNetUnfolderBase]: 825/1454 cut-off events. [2024-11-09 10:26:29,950 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-09 10:26:29,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2735 conditions, 1454 events. 825/1454 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8788 event pairs, 457 based on Foata normal form. 96/1532 useless extension candidates. Maximal degree in co-relation 2724. Up to 1009 conditions per place. [2024-11-09 10:26:29,964 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 33 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2024-11-09 10:26:29,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 55 transitions, 199 flow [2024-11-09 10:26:29,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:26:29,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:26:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-11-09 10:26:29,977 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7608695652173914 [2024-11-09 10:26:29,978 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 95 flow. Second operand 3 states and 105 transitions. [2024-11-09 10:26:29,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 55 transitions, 199 flow [2024-11-09 10:26:29,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 194 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:26:29,984 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 86 flow [2024-11-09 10:26:29,986 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-09 10:26:29,991 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2024-11-09 10:26:29,991 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 86 flow [2024-11-09 10:26:29,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:29,991 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:29,991 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:29,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 10:26:30,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:26:30,197 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:30,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:30,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1561870958, now seen corresponding path program 1 times [2024-11-09 10:26:30,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:26:30,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759739216] [2024-11-09 10:26:30,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:30,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-09 10:26:30,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:26:30,201 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:26:30,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 10:26:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:30,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:26:30,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:26:30,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:30,411 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:26:30,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:26:30,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759739216] [2024-11-09 10:26:30,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759739216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:30,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:30,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:26:30,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808582212] [2024-11-09 10:26:30,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:30,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:26:30,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:26:30,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:26:30,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:26:30,428 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-09 10:26:30,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:30,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:30,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-09 10:26:30,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:30,952 INFO L124 PetriNetUnfolderBase]: 1680/2965 cut-off events. [2024-11-09 10:26:30,952 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2024-11-09 10:26:30,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5698 conditions, 2965 events. 1680/2965 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 19545 event pairs, 188 based on Foata normal form. 100/3009 useless extension candidates. Maximal degree in co-relation 5688. Up to 1579 conditions per place. [2024-11-09 10:26:30,976 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 43 selfloop transitions, 5 changer transitions 1/63 dead transitions. [2024-11-09 10:26:30,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 63 transitions, 242 flow [2024-11-09 10:26:30,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:26:30,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:26:30,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2024-11-09 10:26:30,979 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6467391304347826 [2024-11-09 10:26:30,979 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 86 flow. Second operand 4 states and 119 transitions. [2024-11-09 10:26:30,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 63 transitions, 242 flow [2024-11-09 10:26:30,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 63 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:26:30,984 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 116 flow [2024-11-09 10:26:30,985 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-09 10:26:30,985 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2024-11-09 10:26:30,986 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 116 flow [2024-11-09 10:26:30,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:30,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:30,987 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-09 10:26:30,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 10:26:31,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:26:31,189 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:31,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:31,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1039632501, now seen corresponding path program 1 times [2024-11-09 10:26:31,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:26:31,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72571860] [2024-11-09 10:26:31,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:31,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:26:31,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:26:31,194 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:26:31,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 10:26:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:31,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:26:31,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:26:31,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:31,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:26:31,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:26:31,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72571860] [2024-11-09 10:26:31,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72571860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:31,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:31,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:26:31,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648740790] [2024-11-09 10:26:31,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:31,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:26:31,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:26:31,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:26:31,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:26:31,365 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-09 10:26:31,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:31,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:31,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-09 10:26:31,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:31,729 INFO L124 PetriNetUnfolderBase]: 1038/1843 cut-off events. [2024-11-09 10:26:31,729 INFO L125 PetriNetUnfolderBase]: For 435/435 co-relation queries the response was YES. [2024-11-09 10:26:31,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4076 conditions, 1843 events. 1038/1843 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 10560 event pairs, 100 based on Foata normal form. 82/1880 useless extension candidates. Maximal degree in co-relation 4064. Up to 697 conditions per place. [2024-11-09 10:26:31,744 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 54 selfloop transitions, 8 changer transitions 1/77 dead transitions. [2024-11-09 10:26:31,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 77 transitions, 335 flow [2024-11-09 10:26:31,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:26:31,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:26:31,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-11-09 10:26:31,746 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2024-11-09 10:26:31,746 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 116 flow. Second operand 5 states and 150 transitions. [2024-11-09 10:26:31,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 77 transitions, 335 flow [2024-11-09 10:26:31,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 77 transitions, 325 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 10:26:31,751 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 156 flow [2024-11-09 10:26:31,752 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-09 10:26:31,753 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2024-11-09 10:26:31,754 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 156 flow [2024-11-09 10:26:31,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:31,754 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:31,754 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:31,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 10:26:31,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:26:31,959 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:31,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:31,959 INFO L85 PathProgramCache]: Analyzing trace with hash -634988102, now seen corresponding path program 1 times [2024-11-09 10:26:31,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:26:31,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933124177] [2024-11-09 10:26:31,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:31,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:26:31,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:26:31,965 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:26:31,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 10:26:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:32,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:26:32,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:26:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:32,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:26:32,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:26:32,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933124177] [2024-11-09 10:26:32,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1933124177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:32,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:32,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:26:32,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612280066] [2024-11-09 10:26:32,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:32,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:26:32,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:26:32,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:26:32,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:26:32,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-09 10:26:32,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:32,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:32,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-09 10:26:32,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:32,626 INFO L124 PetriNetUnfolderBase]: 581/992 cut-off events. [2024-11-09 10:26:32,627 INFO L125 PetriNetUnfolderBase]: For 756/756 co-relation queries the response was YES. [2024-11-09 10:26:32,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2526 conditions, 992 events. 581/992 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4606 event pairs, 83 based on Foata normal form. 40/992 useless extension candidates. Maximal degree in co-relation 2512. Up to 308 conditions per place. [2024-11-09 10:26:32,635 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 47 selfloop transitions, 11 changer transitions 1/73 dead transitions. [2024-11-09 10:26:32,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 73 transitions, 342 flow [2024-11-09 10:26:32,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:26:32,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:26:32,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2024-11-09 10:26:32,637 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5905797101449275 [2024-11-09 10:26:32,637 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 156 flow. Second operand 6 states and 163 transitions. [2024-11-09 10:26:32,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 73 transitions, 342 flow [2024-11-09 10:26:32,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 317 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-09 10:26:32,646 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 170 flow [2024-11-09 10:26:32,646 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-09 10:26:32,647 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2024-11-09 10:26:32,647 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 170 flow [2024-11-09 10:26:32,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:32,647 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:32,647 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:32,653 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-09 10:26:32,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:26:32,848 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:32,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:32,849 INFO L85 PathProgramCache]: Analyzing trace with hash 890223659, now seen corresponding path program 1 times [2024-11-09 10:26:32,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:26:32,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136712804] [2024-11-09 10:26:32,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:32,850 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:26:32,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:26:32,851 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:26:32,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 10:26:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:32,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:26:32,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:26:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:33,023 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:26:33,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:26:33,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136712804] [2024-11-09 10:26:33,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136712804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:33,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:33,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:26:33,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424255788] [2024-11-09 10:26:33,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:33,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:26:33,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:26:33,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:26:33,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:26:33,026 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 46 [2024-11-09 10:26:33,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:33,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:33,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 46 [2024-11-09 10:26:33,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:33,164 INFO L124 PetriNetUnfolderBase]: 307/639 cut-off events. [2024-11-09 10:26:33,165 INFO L125 PetriNetUnfolderBase]: For 249/259 co-relation queries the response was YES. [2024-11-09 10:26:33,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1416 conditions, 639 events. 307/639 cut-off events. For 249/259 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3238 event pairs, 288 based on Foata normal form. 8/602 useless extension candidates. Maximal degree in co-relation 1401. Up to 481 conditions per place. [2024-11-09 10:26:33,170 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 18 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2024-11-09 10:26:33,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 43 transitions, 208 flow [2024-11-09 10:26:33,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:26:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:26:33,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-11-09 10:26:33,172 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5869565217391305 [2024-11-09 10:26:33,173 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 170 flow. Second operand 3 states and 81 transitions. [2024-11-09 10:26:33,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 43 transitions, 208 flow [2024-11-09 10:26:33,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 152 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-09 10:26:33,178 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 112 flow [2024-11-09 10:26:33,179 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-09 10:26:33,180 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2024-11-09 10:26:33,181 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 112 flow [2024-11-09 10:26:33,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:33,181 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:33,181 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:33,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-09 10:26:33,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:26:33,386 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:33,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:33,387 INFO L85 PathProgramCache]: Analyzing trace with hash 890225180, now seen corresponding path program 1 times [2024-11-09 10:26:33,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:26:33,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88404233] [2024-11-09 10:26:33,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:33,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:26:33,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:26:33,389 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:26:33,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 10:26:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:33,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:26:33,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:26:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:33,917 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:26:33,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:26:33,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88404233] [2024-11-09 10:26:33,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88404233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:33,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:33,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:26:33,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747580375] [2024-11-09 10:26:33,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:33,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 10:26:33,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:26:33,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 10:26:33,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 10:26:33,927 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 46 [2024-11-09 10:26:33,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 112 flow. Second operand has 9 states, 9 states have (on average 21.88888888888889) internal successors, (197), 9 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:33,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:33,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 46 [2024-11-09 10:26:33,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:34,321 INFO L124 PetriNetUnfolderBase]: 444/868 cut-off events. [2024-11-09 10:26:34,321 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:26:34,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1719 conditions, 868 events. 444/868 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4331 event pairs, 116 based on Foata normal form. 8/839 useless extension candidates. Maximal degree in co-relation 1712. Up to 229 conditions per place. [2024-11-09 10:26:34,327 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 32 selfloop transitions, 4 changer transitions 24/82 dead transitions. [2024-11-09 10:26:34,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 82 transitions, 320 flow [2024-11-09 10:26:34,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:26:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 10:26:34,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 241 transitions. [2024-11-09 10:26:34,332 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5821256038647343 [2024-11-09 10:26:34,332 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 112 flow. Second operand 9 states and 241 transitions. [2024-11-09 10:26:34,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 82 transitions, 320 flow [2024-11-09 10:26:34,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 82 transitions, 319 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:26:34,337 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 129 flow [2024-11-09 10:26:34,337 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=129, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2024-11-09 10:26:34,338 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2024-11-09 10:26:34,338 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 129 flow [2024-11-09 10:26:34,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.88888888888889) internal successors, (197), 9 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:34,338 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:34,339 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:34,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-09 10:26:34,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:26:34,540 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:34,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:34,540 INFO L85 PathProgramCache]: Analyzing trace with hash 20503510, now seen corresponding path program 2 times [2024-11-09 10:26:34,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:26:34,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214143511] [2024-11-09 10:26:34,541 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:26:34,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:26:34,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:26:34,543 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:26:34,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 10:26:34,629 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 10:26:34,629 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:26:34,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:26:34,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:26:34,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:34,674 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:26:34,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:26:34,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214143511] [2024-11-09 10:26:34,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [214143511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:34,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:34,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:26:34,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521655726] [2024-11-09 10:26:34,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:34,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:26:34,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:26:34,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:26:34,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:26:34,692 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-09 10:26:34,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 42 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:34,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:34,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-09 10:26:34,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:34,930 INFO L124 PetriNetUnfolderBase]: 694/1343 cut-off events. [2024-11-09 10:26:34,930 INFO L125 PetriNetUnfolderBase]: For 219/227 co-relation queries the response was YES. [2024-11-09 10:26:34,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2877 conditions, 1343 events. 694/1343 cut-off events. For 219/227 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7731 event pairs, 321 based on Foata normal form. 8/1268 useless extension candidates. Maximal degree in co-relation 2865. Up to 605 conditions per place. [2024-11-09 10:26:34,937 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 30 selfloop transitions, 2 changer transitions 13/65 dead transitions. [2024-11-09 10:26:34,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 281 flow [2024-11-09 10:26:34,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:26:34,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:26:34,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-11-09 10:26:34,939 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.591304347826087 [2024-11-09 10:26:34,939 INFO L175 Difference]: Start difference. First operand has 60 places, 42 transitions, 129 flow. Second operand 5 states and 136 transitions. [2024-11-09 10:26:34,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 281 flow [2024-11-09 10:26:34,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 65 transitions, 259 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-11-09 10:26:34,943 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 127 flow [2024-11-09 10:26:34,943 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=49, 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=127, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2024-11-09 10:26:34,943 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2024-11-09 10:26:34,944 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 127 flow [2024-11-09 10:26:34,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:34,944 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:34,944 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:34,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 10:26:35,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:26:35,146 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:35,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:35,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1291072348, now seen corresponding path program 3 times [2024-11-09 10:26:35,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:26:35,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269035990] [2024-11-09 10:26:35,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:26:35,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:26:35,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:26:35,151 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:26:35,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 10:26:35,238 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 10:26:35,239 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:26:35,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:26:35,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:26:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:35,303 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:26:35,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:26:35,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269035990] [2024-11-09 10:26:35,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1269035990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:35,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:35,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:26:35,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511828091] [2024-11-09 10:26:35,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:35,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:26:35,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:26:35,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:26:35,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:26:35,317 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-09 10:26:35,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 127 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:35,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:35,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-09 10:26:35,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:35,562 INFO L124 PetriNetUnfolderBase]: 550/1088 cut-off events. [2024-11-09 10:26:35,562 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2024-11-09 10:26:35,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2216 conditions, 1088 events. 550/1088 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5705 event pairs, 187 based on Foata normal form. 8/1047 useless extension candidates. Maximal degree in co-relation 2205. Up to 405 conditions per place. [2024-11-09 10:26:35,567 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 24 selfloop transitions, 1 changer transitions 22/67 dead transitions. [2024-11-09 10:26:35,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 67 transitions, 280 flow [2024-11-09 10:26:35,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:26:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:26:35,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2024-11-09 10:26:35,569 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2024-11-09 10:26:35,569 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 127 flow. Second operand 6 states and 156 transitions. [2024-11-09 10:26:35,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 67 transitions, 280 flow [2024-11-09 10:26:35,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 67 transitions, 266 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 10:26:35,572 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 128 flow [2024-11-09 10:26:35,572 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=50, 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=128, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2024-11-09 10:26:35,573 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2024-11-09 10:26:35,573 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 128 flow [2024-11-09 10:26:35,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:35,573 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:35,573 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:35,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-09 10:26:35,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:26:35,775 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:35,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:35,775 INFO L85 PathProgramCache]: Analyzing trace with hash 778655608, now seen corresponding path program 4 times [2024-11-09 10:26:35,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:26:35,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197374192] [2024-11-09 10:26:35,776 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:26:35,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:26:35,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:26:35,779 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:26:35,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 10:26:35,869 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 10:26:35,870 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 10:26:35,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:26:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:26:35,990 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 10:26:35,991 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:26:35,995 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-09 10:26:35,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-09 10:26:35,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-09 10:26:35,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-09 10:26:35,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-09 10:26:35,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-09 10:26:35,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:26:36,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-09 10:26:36,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:26:36,200 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-09 10:26:36,297 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:26:36,297 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:26:36,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:26:36 BasicIcfg [2024-11-09 10:26:36,305 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:26:36,306 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:26:36,306 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:26:36,306 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:26:36,306 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:26:29" (3/4) ... [2024-11-09 10:26:36,308 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:26:36,309 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:26:36,310 INFO L158 Benchmark]: Toolchain (without parser) took 8888.19ms. Allocated memory was 60.8MB in the beginning and 228.6MB in the end (delta: 167.8MB). Free memory was 31.0MB in the beginning and 147.3MB in the end (delta: -116.3MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. [2024-11-09 10:26:36,310 INFO L158 Benchmark]: CDTParser took 1.16ms. Allocated memory is still 60.8MB. Free memory was 37.3MB in the beginning and 37.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:26:36,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 621.80ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 30.8MB in the beginning and 37.0MB in the end (delta: -6.2MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-11-09 10:26:36,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.65ms. Allocated memory is still 77.6MB. Free memory was 36.7MB in the beginning and 34.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:26:36,311 INFO L158 Benchmark]: Boogie Preprocessor took 67.45ms. Allocated memory is still 77.6MB. Free memory was 34.2MB in the beginning and 55.5MB in the end (delta: -21.3MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-11-09 10:26:36,313 INFO L158 Benchmark]: RCFGBuilder took 906.53ms. Allocated memory is still 77.6MB. Free memory was 55.5MB in the beginning and 34.5MB in the end (delta: 21.0MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2024-11-09 10:26:36,313 INFO L158 Benchmark]: TraceAbstraction took 7223.80ms. Allocated memory was 77.6MB in the beginning and 228.6MB in the end (delta: 151.0MB). Free memory was 34.0MB in the beginning and 147.3MB in the end (delta: -113.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-09 10:26:36,313 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 228.6MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:26:36,315 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16ms. Allocated memory is still 60.8MB. Free memory was 37.3MB in the beginning and 37.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 621.80ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 30.8MB in the beginning and 37.0MB in the end (delta: -6.2MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.65ms. Allocated memory is still 77.6MB. Free memory was 36.7MB in the beginning and 34.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.45ms. Allocated memory is still 77.6MB. Free memory was 34.2MB in the beginning and 55.5MB in the end (delta: -21.3MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * RCFGBuilder took 906.53ms. Allocated memory is still 77.6MB. Free memory was 55.5MB in the beginning and 34.5MB in the end (delta: 21.0MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7223.80ms. Allocated memory was 77.6MB in the beginning and 228.6MB in the end (delta: 151.0MB). Free memory was 34.0MB in the beginning and 147.3MB in the end (delta: -113.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 228.6MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t153; [L844] FCALL, FORK 0 pthread_create(&t153, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t153=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L845] 0 pthread_t t154; [L846] FCALL, FORK 0 pthread_create(&t154, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t153=0, t154=1, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 0 pthread_t t155; [L848] FCALL, FORK 0 pthread_create(&t155, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t153=0, t154=1, t155=2, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L786] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L787] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L789] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L799] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 z$flush_delayed = weak$$choice2 [L808] 3 z$mem_tmp = z [L809] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L810] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L811] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L812] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L813] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L815] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = z [L817] 3 z = z$flush_delayed ? z$mem_tmp : z [L818] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t153=0, t154=1, t155=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t153=0, t154=1, t155=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t153=0, t154=1, t155=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix006_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=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 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: 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.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 326 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 306 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1025 IncrementalHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 13 mSDtfsCounter, 1025 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.3s 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.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 683 SizeOfPredicates, 13 NumberOfNonLiveVariables, 887 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-09 10:26:36,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample