./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix001.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix001.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 54b7204af3591799bdde98d626e5c17b99e9c1ebc668ecbb3e0b1bb3bb8aa3c2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 17:19:15,570 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:19:15,638 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 17:19:15,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:19:15,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:19:15,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:19:15,672 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:19:15,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:19:15,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:19:15,673 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:19:15,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:19:15,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:19:15,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:19:15,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:19:15,675 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:19:15,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:19:15,676 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:19:15,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:19:15,677 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:19:15,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:19:15,677 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:19:15,681 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:19:15,682 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:19:15,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:19:15,682 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:19:15,682 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:19:15,682 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:19:15,683 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:19:15,683 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:19:15,683 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:19:15,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:19:15,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:19:15,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:19:15,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:19:15,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:19:15,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:19:15,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 17:19:15,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 17:19:15,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:19:15,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:19:15,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:19:15,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:19:15,685 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 -> 54b7204af3591799bdde98d626e5c17b99e9c1ebc668ecbb3e0b1bb3bb8aa3c2 [2024-11-20 17:19:15,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:19:15,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:19:15,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:19:15,949 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:19:15,949 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:19:15,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix001.oepc.i [2024-11-20 17:19:17,258 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:19:17,487 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:19:17,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix001.oepc.i [2024-11-20 17:19:17,499 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67afc84ba/ba8afb68319146429ab087d1bd0dc3bf/FLAG9147a97ca [2024-11-20 17:19:17,832 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67afc84ba/ba8afb68319146429ab087d1bd0dc3bf [2024-11-20 17:19:17,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:19:17,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:19:17,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:19:17,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:19:17,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:19:17,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:19:17" (1/1) ... [2024-11-20 17:19:17,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f05e95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:17, skipping insertion in model container [2024-11-20 17:19:17,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:19:17" (1/1) ... [2024-11-20 17:19:17,891 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:19:18,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:19:18,260 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:19:18,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:19:18,354 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:19:18,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:18 WrapperNode [2024-11-20 17:19:18,355 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:19:18,356 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:19:18,356 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:19:18,356 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:19:18,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:18" (1/1) ... [2024-11-20 17:19:18,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:18" (1/1) ... [2024-11-20 17:19:18,398 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 145 [2024-11-20 17:19:18,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:19:18,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:19:18,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:19:18,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:19:18,407 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:18" (1/1) ... [2024-11-20 17:19:18,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:18" (1/1) ... [2024-11-20 17:19:18,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:18" (1/1) ... [2024-11-20 17:19:18,423 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 17:19:18,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:18" (1/1) ... [2024-11-20 17:19:18,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:18" (1/1) ... [2024-11-20 17:19:18,429 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:18" (1/1) ... [2024-11-20 17:19:18,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:18" (1/1) ... [2024-11-20 17:19:18,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:18" (1/1) ... [2024-11-20 17:19:18,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:18" (1/1) ... [2024-11-20 17:19:18,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:19:18,437 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:19:18,437 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:19:18,437 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:19:18,438 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:18" (1/1) ... [2024-11-20 17:19:18,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:19:18,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:19:18,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 17:19:18,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 17:19:18,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-20 17:19:18,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:19:18,518 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-20 17:19:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-20 17:19:18,522 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-20 17:19:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-20 17:19:18,522 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-20 17:19:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-20 17:19:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 17:19:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-20 17:19:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:19:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:19:18,524 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 17:19:18,695 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:19:18,697 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:19:19,034 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 17:19:19,034 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:19:19,226 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:19:19,226 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 17:19:19,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:19:19 BoogieIcfgContainer [2024-11-20 17:19:19,227 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:19:19,229 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:19:19,229 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:19:19,232 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:19:19,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:19:17" (1/3) ... [2024-11-20 17:19:19,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f5cdd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:19:19, skipping insertion in model container [2024-11-20 17:19:19,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:18" (2/3) ... [2024-11-20 17:19:19,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f5cdd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:19:19, skipping insertion in model container [2024-11-20 17:19:19,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:19:19" (3/3) ... [2024-11-20 17:19:19,236 INFO L112 eAbstractionObserver]: Analyzing ICFG mix001.oepc.i [2024-11-20 17:19:19,250 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:19:19,252 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-20 17:19:19,252 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 17:19:19,323 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 17:19:19,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 106 flow [2024-11-20 17:19:19,395 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2024-11-20 17:19:19,396 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:19:19,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 2/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2024-11-20 17:19:19,401 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 106 flow [2024-11-20 17:19:19,405 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 44 transitions, 97 flow [2024-11-20 17:19:19,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:19:19,424 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;@5eb0dcfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:19:19,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-20 17:19:19,427 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 17:19:19,428 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-20 17:19:19,428 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:19:19,428 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:19:19,429 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-20 17:19:19,432 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-20 17:19:19,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:19:19,438 INFO L85 PathProgramCache]: Analyzing trace with hash 13601757, now seen corresponding path program 1 times [2024-11-20 17:19:19,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:19:19,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070804401] [2024-11-20 17:19:19,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:19:19,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:19:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:19:19,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:19:19,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:19:19,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070804401] [2024-11-20 17:19:19,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070804401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:19:19,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:19:19,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:19:19,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303692262] [2024-11-20 17:19:19,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:19:19,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:19:19,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:19:19,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:19:19,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:19:19,895 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-11-20 17:19:19,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 97 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-20 17:19:19,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:19:19,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-11-20 17:19:19,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:19:20,316 INFO L124 PetriNetUnfolderBase]: 1057/1867 cut-off events. [2024-11-20 17:19:20,316 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-20 17:19:20,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3492 conditions, 1867 events. 1057/1867 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 12586 event pairs, 129 based on Foata normal form. 120/1964 useless extension candidates. Maximal degree in co-relation 3481. Up to 1345 conditions per place. [2024-11-20 17:19:20,332 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 34 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2024-11-20 17:19:20,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 203 flow [2024-11-20 17:19:20,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:19:20,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:19:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-11-20 17:19:20,342 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75177304964539 [2024-11-20 17:19:20,344 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 97 flow. Second operand 3 states and 106 transitions. [2024-11-20 17:19:20,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 203 flow [2024-11-20 17:19:20,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-20 17:19:20,348 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow [2024-11-20 17:19:20,349 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-20 17:19:20,352 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2024-11-20 17:19:20,353 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow [2024-11-20 17:19:20,353 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-20 17:19:20,354 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:19:20,354 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:19:20,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 17:19:20,354 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-20 17:19:20,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:19:20,355 INFO L85 PathProgramCache]: Analyzing trace with hash -590684286, now seen corresponding path program 1 times [2024-11-20 17:19:20,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:19:20,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241403182] [2024-11-20 17:19:20,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:19:20,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:19:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:19:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:19:20,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:19:20,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241403182] [2024-11-20 17:19:20,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241403182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:19:20,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:19:20,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:19:20,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71227786] [2024-11-20 17:19:20,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:19:20,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:19:20,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:19:20,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:19:20,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:19:20,433 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-11-20 17:19:20,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 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-20 17:19:20,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:19:20,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-11-20 17:19:20,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:19:20,690 INFO L124 PetriNetUnfolderBase]: 924/1751 cut-off events. [2024-11-20 17:19:20,690 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-11-20 17:19:20,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3274 conditions, 1751 events. 924/1751 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11957 event pairs, 924 based on Foata normal form. 60/1745 useless extension candidates. Maximal degree in co-relation 3264. Up to 1385 conditions per place. [2024-11-20 17:19:20,699 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 19 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2024-11-20 17:19:20,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 128 flow [2024-11-20 17:19:20,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:19:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:19:20,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-11-20 17:19:20,701 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5815602836879432 [2024-11-20 17:19:20,701 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 3 states and 82 transitions. [2024-11-20 17:19:20,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 128 flow [2024-11-20 17:19:20,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 17:19:20,703 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 82 flow [2024-11-20 17:19:20,703 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-20 17:19:20,703 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2024-11-20 17:19:20,704 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 82 flow [2024-11-20 17:19:20,704 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-20 17:19:20,704 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:19:20,704 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:19:20,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 17:19:20,704 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-20 17:19:20,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:19:20,705 INFO L85 PathProgramCache]: Analyzing trace with hash -590684458, now seen corresponding path program 1 times [2024-11-20 17:19:20,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:19:20,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268325286] [2024-11-20 17:19:20,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:19:20,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:19:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:19:20,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:19:20,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:19:20,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268325286] [2024-11-20 17:19:20,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268325286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:19:20,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:19:20,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:19:20,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212855577] [2024-11-20 17:19:20,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:19:20,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:19:20,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:19:20,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:19:20,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:19:20,940 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-11-20 17:19:20,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 82 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-20 17:19:20,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:19:20,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-11-20 17:19:20,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:19:21,329 INFO L124 PetriNetUnfolderBase]: 1799/3121 cut-off events. [2024-11-20 17:19:21,329 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:19:21,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5887 conditions, 3121 events. 1799/3121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20154 event pairs, 235 based on Foata normal form. 120/3195 useless extension candidates. Maximal degree in co-relation 5881. Up to 1551 conditions per place. [2024-11-20 17:19:21,343 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 45 selfloop transitions, 5 changer transitions 1/64 dead transitions. [2024-11-20 17:19:21,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 64 transitions, 242 flow [2024-11-20 17:19:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:19:21,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 17:19:21,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2024-11-20 17:19:21,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6436170212765957 [2024-11-20 17:19:21,347 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 82 flow. Second operand 4 states and 121 transitions. [2024-11-20 17:19:21,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 64 transitions, 242 flow [2024-11-20 17:19:21,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 241 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:19:21,349 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 115 flow [2024-11-20 17:19:21,349 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-11-20 17:19:21,350 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2024-11-20 17:19:21,350 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 115 flow [2024-11-20 17:19:21,350 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-20 17:19:21,352 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:19:21,352 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:19:21,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 17:19:21,352 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-20 17:19:21,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:19:21,353 INFO L85 PathProgramCache]: Analyzing trace with hash -2082968524, now seen corresponding path program 1 times [2024-11-20 17:19:21,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:19:21,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132127507] [2024-11-20 17:19:21,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:19:21,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:19:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:19:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:19:21,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:19:21,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132127507] [2024-11-20 17:19:21,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132127507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:19:21,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:19:21,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:19:21,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868540311] [2024-11-20 17:19:21,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:19:21,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:19:21,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:19:21,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:19:21,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:19:21,642 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-11-20 17:19:21,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:19:21,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:19:21,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-11-20 17:19:21,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:19:21,962 INFO L124 PetriNetUnfolderBase]: 1129/1959 cut-off events. [2024-11-20 17:19:21,962 INFO L125 PetriNetUnfolderBase]: For 454/454 co-relation queries the response was YES. [2024-11-20 17:19:21,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4398 conditions, 1959 events. 1129/1959 cut-off events. For 454/454 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10973 event pairs, 133 based on Foata normal form. 96/2020 useless extension candidates. Maximal degree in co-relation 4389. Up to 641 conditions per place. [2024-11-20 17:19:21,972 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 57 selfloop transitions, 8 changer transitions 1/79 dead transitions. [2024-11-20 17:19:21,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 79 transitions, 346 flow [2024-11-20 17:19:21,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:19:21,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:19:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2024-11-20 17:19:21,974 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6510638297872341 [2024-11-20 17:19:21,974 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 115 flow. Second operand 5 states and 153 transitions. [2024-11-20 17:19:21,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 79 transitions, 346 flow [2024-11-20 17:19:21,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 336 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-20 17:19:21,977 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 155 flow [2024-11-20 17:19:21,977 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2024-11-20 17:19:21,978 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2024-11-20 17:19:21,978 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 155 flow [2024-11-20 17:19:21,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:19:21,978 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:19:21,978 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:19:21,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 17:19:21,979 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-20 17:19:21,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:19:21,979 INFO L85 PathProgramCache]: Analyzing trace with hash -444173791, now seen corresponding path program 1 times [2024-11-20 17:19:21,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:19:21,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70309274] [2024-11-20 17:19:21,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:19:21,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:19:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:19:22,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:19:22,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:19:22,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70309274] [2024-11-20 17:19:22,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70309274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:19:22,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:19:22,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:19:22,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727952367] [2024-11-20 17:19:22,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:19:22,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:19:22,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:19:22,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:19:22,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:19:22,315 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-11-20 17:19:22,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:19:22,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:19:22,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-11-20 17:19:22,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:19:22,592 INFO L124 PetriNetUnfolderBase]: 675/1129 cut-off events. [2024-11-20 17:19:22,592 INFO L125 PetriNetUnfolderBase]: For 850/850 co-relation queries the response was YES. [2024-11-20 17:19:22,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2882 conditions, 1129 events. 675/1129 cut-off events. For 850/850 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5265 event pairs, 113 based on Foata normal form. 44/1138 useless extension candidates. Maximal degree in co-relation 2871. Up to 364 conditions per place. [2024-11-20 17:19:22,598 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 49 selfloop transitions, 11 changer transitions 1/74 dead transitions. [2024-11-20 17:19:22,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 349 flow [2024-11-20 17:19:22,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:19:22,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:19:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-11-20 17:19:22,600 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5851063829787234 [2024-11-20 17:19:22,601 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 155 flow. Second operand 6 states and 165 transitions. [2024-11-20 17:19:22,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 349 flow [2024-11-20 17:19:22,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 324 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-20 17:19:22,606 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 169 flow [2024-11-20 17:19:22,606 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2024-11-20 17:19:22,607 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2024-11-20 17:19:22,607 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 169 flow [2024-11-20 17:19:22,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:19:22,607 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:19:22,607 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:19:22,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 17:19:22,608 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-20 17:19:22,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:19:22,608 INFO L85 PathProgramCache]: Analyzing trace with hash -28906958, now seen corresponding path program 1 times [2024-11-20 17:19:22,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:19:22,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621950055] [2024-11-20 17:19:22,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:19:22,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:19:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:19:22,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:19:22,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:19:22,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621950055] [2024-11-20 17:19:22,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621950055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:19:22,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:19:22,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 17:19:22,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721479593] [2024-11-20 17:19:22,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:19:22,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 17:19:22,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:19:22,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 17:19:23,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:19:23,010 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-11-20 17:19:23,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 169 flow. Second operand has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:19:23,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:19:23,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-11-20 17:19:23,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:19:23,428 INFO L124 PetriNetUnfolderBase]: 1415/2418 cut-off events. [2024-11-20 17:19:23,429 INFO L125 PetriNetUnfolderBase]: For 901/915 co-relation queries the response was YES. [2024-11-20 17:19:23,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5575 conditions, 2418 events. 1415/2418 cut-off events. For 901/915 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13328 event pairs, 309 based on Foata normal form. 8/2377 useless extension candidates. Maximal degree in co-relation 5563. Up to 1208 conditions per place. [2024-11-20 17:19:23,439 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 39 selfloop transitions, 4 changer transitions 34/94 dead transitions. [2024-11-20 17:19:23,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 94 transitions, 443 flow [2024-11-20 17:19:23,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 17:19:23,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 17:19:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-11-20 17:19:23,440 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.526595744680851 [2024-11-20 17:19:23,440 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 169 flow. Second operand 8 states and 198 transitions. [2024-11-20 17:19:23,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 94 transitions, 443 flow [2024-11-20 17:19:23,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 94 transitions, 379 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-20 17:19:23,451 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 147 flow [2024-11-20 17:19:23,451 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=147, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2024-11-20 17:19:23,453 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places. [2024-11-20 17:19:23,453 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 147 flow [2024-11-20 17:19:23,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:19:23,454 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:19:23,454 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:19:23,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 17:19:23,454 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-20 17:19:23,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:19:23,455 INFO L85 PathProgramCache]: Analyzing trace with hash 610572150, now seen corresponding path program 2 times [2024-11-20 17:19:23,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:19:23,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370273506] [2024-11-20 17:19:23,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:19:23,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:19:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:19:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:19:25,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:19:25,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370273506] [2024-11-20 17:19:25,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370273506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:19:25,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:19:25,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 17:19:25,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209004993] [2024-11-20 17:19:25,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:19:25,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 17:19:25,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:19:25,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 17:19:25,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:19:25,891 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-11-20 17:19:25,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 147 flow. Second operand has 10 states, 10 states have (on average 21.8) internal successors, (218), 10 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:19:25,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:19:25,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-11-20 17:19:25,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:19:26,672 INFO L124 PetriNetUnfolderBase]: 746/1433 cut-off events. [2024-11-20 17:19:26,673 INFO L125 PetriNetUnfolderBase]: For 249/278 co-relation queries the response was YES. [2024-11-20 17:19:26,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3086 conditions, 1433 events. 746/1433 cut-off events. For 249/278 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8009 event pairs, 139 based on Foata normal form. 10/1360 useless extension candidates. Maximal degree in co-relation 3072. Up to 498 conditions per place. [2024-11-20 17:19:26,680 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 45 selfloop transitions, 16 changer transitions 23/107 dead transitions. [2024-11-20 17:19:26,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 107 transitions, 467 flow [2024-11-20 17:19:26,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 17:19:26,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-20 17:19:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 284 transitions. [2024-11-20 17:19:26,681 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6042553191489362 [2024-11-20 17:19:26,682 INFO L175 Difference]: Start difference. First operand has 62 places, 45 transitions, 147 flow. Second operand 10 states and 284 transitions. [2024-11-20 17:19:26,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 107 transitions, 467 flow [2024-11-20 17:19:26,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 107 transitions, 457 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-20 17:19:26,684 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 239 flow [2024-11-20 17:19:26,685 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=239, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2024-11-20 17:19:26,685 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 18 predicate places. [2024-11-20 17:19:26,685 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 239 flow [2024-11-20 17:19:26,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.8) internal successors, (218), 10 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:19:26,686 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:19:26,686 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:19:26,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 17:19:26,686 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-20 17:19:26,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:19:26,686 INFO L85 PathProgramCache]: Analyzing trace with hash -74437804, now seen corresponding path program 3 times [2024-11-20 17:19:26,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:19:26,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604893900] [2024-11-20 17:19:26,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:19:26,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:19:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:19:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:19:26,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:19:26,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604893900] [2024-11-20 17:19:26,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604893900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:19:26,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:19:26,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 17:19:26,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584788863] [2024-11-20 17:19:26,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:19:26,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 17:19:26,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:19:26,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 17:19:26,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:19:26,996 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-11-20 17:19:26,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:19:26,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:19:26,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-11-20 17:19:26,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:19:27,388 INFO L124 PetriNetUnfolderBase]: 1419/2569 cut-off events. [2024-11-20 17:19:27,389 INFO L125 PetriNetUnfolderBase]: For 1291/1291 co-relation queries the response was YES. [2024-11-20 17:19:27,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6644 conditions, 2569 events. 1419/2569 cut-off events. For 1291/1291 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 15545 event pairs, 219 based on Foata normal form. 8/2498 useless extension candidates. Maximal degree in co-relation 6625. Up to 1077 conditions per place. [2024-11-20 17:19:27,400 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 31 selfloop transitions, 3 changer transitions 57/108 dead transitions. [2024-11-20 17:19:27,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 108 transitions, 624 flow [2024-11-20 17:19:27,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 17:19:27,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 17:19:27,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2024-11-20 17:19:27,401 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-20 17:19:27,402 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 239 flow. Second operand 8 states and 188 transitions. [2024-11-20 17:19:27,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 108 transitions, 624 flow [2024-11-20 17:19:27,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 108 transitions, 610 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-11-20 17:19:27,406 INFO L231 Difference]: Finished difference. Result has 77 places, 43 transitions, 167 flow [2024-11-20 17:19:27,406 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=167, PETRI_PLACES=77, PETRI_TRANSITIONS=43} [2024-11-20 17:19:27,407 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 25 predicate places. [2024-11-20 17:19:27,407 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 43 transitions, 167 flow [2024-11-20 17:19:27,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:19:27,407 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:19:27,407 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:19:27,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 17:19:27,408 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-20 17:19:27,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:19:27,408 INFO L85 PathProgramCache]: Analyzing trace with hash -550438740, now seen corresponding path program 4 times [2024-11-20 17:19:27,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:19:27,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454116956] [2024-11-20 17:19:27,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:19:27,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:19:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:19:27,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 17:19:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:19:27,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 17:19:27,654 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 17:19:27,655 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-20 17:19:27,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-20 17:19:27,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-20 17:19:27,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-20 17:19:27,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-20 17:19:27,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-20 17:19:27,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-20 17:19:27,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 17:19:27,658 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-20 17:19:27,744 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 17:19:27,745 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 17:19:27,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:19:27 BasicIcfg [2024-11-20 17:19:27,749 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 17:19:27,749 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 17:19:27,750 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 17:19:27,750 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 17:19:27,750 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:19:19" (3/4) ... [2024-11-20 17:19:27,752 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 17:19:27,753 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 17:19:27,754 INFO L158 Benchmark]: Toolchain (without parser) took 9917.66ms. Allocated memory was 148.9MB in the beginning and 513.8MB in the end (delta: 364.9MB). Free memory was 95.9MB in the beginning and 389.6MB in the end (delta: -293.7MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. [2024-11-20 17:19:27,754 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 58.3MB in the beginning and 58.2MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:19:27,754 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.22ms. Allocated memory is still 148.9MB. Free memory was 95.9MB in the beginning and 105.5MB in the end (delta: -9.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 17:19:27,754 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.05ms. Allocated memory is still 148.9MB. Free memory was 104.7MB in the beginning and 102.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 17:19:27,755 INFO L158 Benchmark]: Boogie Preprocessor took 37.38ms. Allocated memory is still 148.9MB. Free memory was 102.1MB in the beginning and 97.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 17:19:27,755 INFO L158 Benchmark]: RCFGBuilder took 790.38ms. Allocated memory is still 148.9MB. Free memory was 97.9MB in the beginning and 60.0MB in the end (delta: 38.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-20 17:19:27,755 INFO L158 Benchmark]: TraceAbstraction took 8519.98ms. Allocated memory was 148.9MB in the beginning and 513.8MB in the end (delta: 364.9MB). Free memory was 58.7MB in the beginning and 389.6MB in the end (delta: -330.9MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2024-11-20 17:19:27,756 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 513.8MB. Free memory is still 389.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:19:27,757 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.16ms. Allocated memory is still 96.5MB. Free memory was 58.3MB in the beginning and 58.2MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.22ms. Allocated memory is still 148.9MB. Free memory was 95.9MB in the beginning and 105.5MB in the end (delta: -9.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.05ms. Allocated memory is still 148.9MB. Free memory was 104.7MB in the beginning and 102.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.38ms. Allocated memory is still 148.9MB. Free memory was 102.1MB in the beginning and 97.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 790.38ms. Allocated memory is still 148.9MB. Free memory was 97.9MB in the beginning and 60.0MB in the end (delta: 38.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8519.98ms. Allocated memory was 148.9MB in the beginning and 513.8MB in the end (delta: 364.9MB). Free memory was 58.7MB in the beginning and 389.6MB in the end (delta: -330.9MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 513.8MB. Free memory is still 389.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p1_EBX = 0; [L720] 0 int __unbuffered_p2_EAX = 0; [L722] 0 int __unbuffered_p2_EBX = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff1_thd0; [L738] 0 _Bool z$r_buff1_thd1; [L739] 0 _Bool z$r_buff1_thd2; [L740] 0 _Bool z$r_buff1_thd3; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t14; [L865] FCALL, FORK 0 pthread_create(&t14, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, t14=-1, 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] [L752] 1 z$w_buff1 = z$w_buff0 [L753] 1 z$w_buff0 = 1 [L754] 1 z$w_buff1_used = z$w_buff0_used [L755] 1 z$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L757] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L758] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L759] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L760] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L761] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L866] 0 pthread_t t15; [L867] FCALL, FORK 0 pthread_create(&t15, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, t14=-1, t15=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] [L868] 0 pthread_t t16; [L869] FCALL, FORK 0 pthread_create(&t16, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, t14=-1, t15=0, t16=1, 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] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 z$flush_delayed = weak$$choice2 [L767] 1 z$mem_tmp = z [L768] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 __unbuffered_p0_EAX = z [L776] 1 z = z$flush_delayed ? z$mem_tmp : z [L777] 1 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, weak$$choice2=1, 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] [L780] 1 __unbuffered_p0_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __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=1, weak$$choice2=1, 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] [L797] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, weak$$choice2=1, 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] [L800] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, weak$$choice2=1, 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] [L803] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, weak$$choice2=1, 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] [L806] 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) [L807] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L808] 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 [L809] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, weak$$choice2=1, 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] [L820] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, weak$$choice2=1, x=1, 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] [L823] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, x=1, 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] [L826] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 3 z$flush_delayed = weak$$choice2 [L829] 3 z$mem_tmp = z [L830] 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) [L831] 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)) [L832] 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)) [L833] 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)) [L834] 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)) [L835] 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)) [L836] 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)) [L837] 3 __unbuffered_p2_EBX = z [L838] 3 z = z$flush_delayed ? z$mem_tmp : z [L839] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, 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] [L842] 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) [L843] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L844] 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 [L845] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L846] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, 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] [L783] 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) [L784] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L785] 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 [L786] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L787] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, 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] [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, 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] [L813] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, 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] [L849] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, 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] [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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, t14=-1, t15=0, t16=1, weak$$choice0=1, weak$$choice2=0, x=1, 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] [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 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) [L876] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L877] 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 [L878] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L879] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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, t14=-1, t15=0, t16=1, weak$$choice0=1, weak$$choice2=0, x=1, 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] [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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, t14=-1, t15=0, t16=1, weak$$choice0=1, weak$$choice2=0, x=1, 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] [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, 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] [L18] 0 __assert_fail ("0", "mix001.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that 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: 869]: 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: 867]: 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, 74 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 439 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 410 mSDsluCounter, 141 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 109 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1136 IncrementalHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 32 mSDtfsCounter, 1136 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=7, InterpolantAutomatonStates: 47, 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, 3.7s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 2078 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-20 17:19:27,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix001.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 54b7204af3591799bdde98d626e5c17b99e9c1ebc668ecbb3e0b1bb3bb8aa3c2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 17:19:29,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:19:29,873 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-20 17:19:29,877 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:19:29,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:19:29,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:19:29,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:19:29,899 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:19:29,899 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:19:29,902 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:19:29,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:19:29,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:19:29,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:19:29,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:19:29,903 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:19:29,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:19:29,904 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:19:29,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:19:29,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:19:29,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:19:29,905 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:19:29,905 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:19:29,906 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:19:29,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:19:29,906 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:19:29,906 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 17:19:29,906 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:19:29,906 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 17:19:29,906 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:19:29,906 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:19:29,907 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:19:29,907 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:19:29,907 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:19:29,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:19:29,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:19:29,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:19:29,907 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:19:29,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:19:29,908 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 17:19:29,908 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 17:19:29,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:19:29,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:19:29,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:19:29,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:19:29,910 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 -> 54b7204af3591799bdde98d626e5c17b99e9c1ebc668ecbb3e0b1bb3bb8aa3c2 [2024-11-20 17:19:30,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:19:30,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:19:30,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:19:30,217 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:19:30,218 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:19:30,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix001.oepc.i [2024-11-20 17:19:31,577 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:19:31,819 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:19:31,819 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix001.oepc.i [2024-11-20 17:19:31,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eace580e/49ce9a27741c4a49aa6c31287055f2dc/FLAGb23100e89 [2024-11-20 17:19:31,860 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eace580e/49ce9a27741c4a49aa6c31287055f2dc [2024-11-20 17:19:31,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:19:31,864 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:19:31,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:19:31,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:19:31,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:19:31,872 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:19:31" (1/1) ... [2024-11-20 17:19:31,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@276ca6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:31, skipping insertion in model container [2024-11-20 17:19:31,873 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:19:31" (1/1) ... [2024-11-20 17:19:31,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:19:32,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:19:32,266 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:19:32,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:19:32,379 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:19:32,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:32 WrapperNode [2024-11-20 17:19:32,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:19:32,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:19:32,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:19:32,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:19:32,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:32" (1/1) ... [2024-11-20 17:19:32,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:32" (1/1) ... [2024-11-20 17:19:32,456 INFO L138 Inliner]: procedures = 176, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 146 [2024-11-20 17:19:32,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:19:32,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:19:32,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:19:32,458 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:19:32,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:32" (1/1) ... [2024-11-20 17:19:32,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:32" (1/1) ... [2024-11-20 17:19:32,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:32" (1/1) ... [2024-11-20 17:19:32,500 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 17:19:32,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:32" (1/1) ... [2024-11-20 17:19:32,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:32" (1/1) ... [2024-11-20 17:19:32,509 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:32" (1/1) ... [2024-11-20 17:19:32,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:32" (1/1) ... [2024-11-20 17:19:32,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:32" (1/1) ... [2024-11-20 17:19:32,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:32" (1/1) ... [2024-11-20 17:19:32,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:19:32,528 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:19:32,529 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:19:32,529 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:19:32,529 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:32" (1/1) ... [2024-11-20 17:19:32,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:19:32,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:19:32,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 17:19:32,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 17:19:32,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-20 17:19:32,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:19:32,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 17:19:32,612 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-20 17:19:32,612 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-20 17:19:32,612 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-20 17:19:32,612 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-20 17:19:32,612 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-20 17:19:32,612 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-20 17:19:32,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-20 17:19:32,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:19:32,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:19:32,615 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 17:19:32,779 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:19:32,780 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:19:33,079 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 17:19:33,079 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:19:33,302 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:19:33,302 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 17:19:33,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:19:33 BoogieIcfgContainer [2024-11-20 17:19:33,303 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:19:33,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:19:33,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:19:33,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:19:33,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:19:31" (1/3) ... [2024-11-20 17:19:33,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57465d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:19:33, skipping insertion in model container [2024-11-20 17:19:33,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:32" (2/3) ... [2024-11-20 17:19:33,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57465d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:19:33, skipping insertion in model container [2024-11-20 17:19:33,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:19:33" (3/3) ... [2024-11-20 17:19:33,311 INFO L112 eAbstractionObserver]: Analyzing ICFG mix001.oepc.i [2024-11-20 17:19:33,325 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:19:33,326 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-20 17:19:33,326 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 17:19:33,392 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 17:19:33,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 106 flow [2024-11-20 17:19:33,456 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2024-11-20 17:19:33,456 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:19:33,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 2/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2024-11-20 17:19:33,460 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 106 flow [2024-11-20 17:19:33,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 44 transitions, 97 flow [2024-11-20 17:19:33,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:19:33,484 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;@4d140bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:19:33,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-20 17:19:33,488 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 17:19:33,489 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-20 17:19:33,489 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:19:33,489 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:19:33,489 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-20 17:19:33,490 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-20 17:19:33,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:19:33,496 INFO L85 PathProgramCache]: Analyzing trace with hash 13663325, now seen corresponding path program 1 times [2024-11-20 17:19:33,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:19:33,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674653603] [2024-11-20 17:19:33,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:19:33,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:19:33,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:19:33,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:19:33,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 17:19:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:19:33,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:19:33,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:19:33,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:19:33,651 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:19:33,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:19:33,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674653603] [2024-11-20 17:19:33,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674653603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:19:33,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:19:33,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:19:33,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647954592] [2024-11-20 17:19:33,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:19:33,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:19:33,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:19:33,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:19:33,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:19:33,692 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-11-20 17:19:33,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 97 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-20 17:19:33,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:19:33,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-11-20 17:19:33,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:19:34,137 INFO L124 PetriNetUnfolderBase]: 1057/1867 cut-off events. [2024-11-20 17:19:34,138 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-20 17:19:34,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3492 conditions, 1867 events. 1057/1867 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 12637 event pairs, 129 based on Foata normal form. 120/1964 useless extension candidates. Maximal degree in co-relation 3481. Up to 1345 conditions per place. [2024-11-20 17:19:34,161 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 34 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2024-11-20 17:19:34,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 203 flow [2024-11-20 17:19:34,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:19:34,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:19:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-11-20 17:19:34,171 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75177304964539 [2024-11-20 17:19:34,173 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 97 flow. Second operand 3 states and 106 transitions. [2024-11-20 17:19:34,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 203 flow [2024-11-20 17:19:34,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-20 17:19:34,179 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow [2024-11-20 17:19:34,180 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-20 17:19:34,186 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2024-11-20 17:19:34,187 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow [2024-11-20 17:19:34,187 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-20 17:19:34,187 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:19:34,187 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:19:34,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 17:19:34,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:19:34,388 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-20 17:19:34,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:19:34,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1197382204, now seen corresponding path program 1 times [2024-11-20 17:19:34,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:19:34,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2068447812] [2024-11-20 17:19:34,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:19:34,390 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:19:34,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:19:34,393 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:19:34,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 17:19:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:19:34,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:19:34,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:19:34,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:19:34,537 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:19:34,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:19:34,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2068447812] [2024-11-20 17:19:34,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2068447812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:19:34,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:19:34,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:19:34,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754001937] [2024-11-20 17:19:34,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:19:34,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:19:34,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:19:34,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:19:34,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:19:34,546 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-11-20 17:19:34,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 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-20 17:19:34,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:19:34,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-11-20 17:19:34,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:19:34,967 INFO L124 PetriNetUnfolderBase]: 2013/3527 cut-off events. [2024-11-20 17:19:34,967 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2024-11-20 17:19:34,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6757 conditions, 3527 events. 2013/3527 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 23513 event pairs, 235 based on Foata normal form. 120/3601 useless extension candidates. Maximal degree in co-relation 6747. Up to 1861 conditions per place. [2024-11-20 17:19:34,983 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 46 selfloop transitions, 5 changer transitions 1/66 dead transitions. [2024-11-20 17:19:34,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 254 flow [2024-11-20 17:19:34,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:19:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 17:19:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2024-11-20 17:19:34,985 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.648936170212766 [2024-11-20 17:19:34,985 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 4 states and 122 transitions. [2024-11-20 17:19:34,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 254 flow [2024-11-20 17:19:34,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 17:19:34,987 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 118 flow [2024-11-20 17:19:34,988 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, 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=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-11-20 17:19:34,988 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2024-11-20 17:19:34,989 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 118 flow [2024-11-20 17:19:34,989 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-20 17:19:34,989 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:19:34,989 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:19:34,992 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-20 17:19:35,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:19:35,190 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-20 17:19:35,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:19:35,193 INFO L85 PathProgramCache]: Analyzing trace with hash -787183006, now seen corresponding path program 1 times [2024-11-20 17:19:35,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:19:35,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600506844] [2024-11-20 17:19:35,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:19:35,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:19:35,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:19:35,196 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:19:35,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 17:19:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:19:35,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:19:35,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:19:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:19:35,321 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:19:35,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:19:35,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600506844] [2024-11-20 17:19:35,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600506844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:19:35,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:19:35,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:19:35,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624593654] [2024-11-20 17:19:35,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:19:35,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:19:35,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:19:35,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:19:35,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:19:35,356 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-11-20 17:19:35,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:19:35,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:19:35,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-11-20 17:19:35,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:19:35,708 INFO L124 PetriNetUnfolderBase]: 1213/2131 cut-off events. [2024-11-20 17:19:35,709 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2024-11-20 17:19:35,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4709 conditions, 2131 events. 1213/2131 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 12270 event pairs, 133 based on Foata normal form. 96/2192 useless extension candidates. Maximal degree in co-relation 4697. Up to 769 conditions per place. [2024-11-20 17:19:35,719 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 58 selfloop transitions, 8 changer transitions 1/81 dead transitions. [2024-11-20 17:19:35,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 81 transitions, 351 flow [2024-11-20 17:19:35,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:19:35,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:19:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-11-20 17:19:35,721 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6553191489361702 [2024-11-20 17:19:35,721 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 118 flow. Second operand 5 states and 154 transitions. [2024-11-20 17:19:35,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 81 transitions, 351 flow [2024-11-20 17:19:35,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 81 transitions, 341 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-20 17:19:35,724 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 158 flow [2024-11-20 17:19:35,724 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2024-11-20 17:19:35,725 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2024-11-20 17:19:35,725 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 158 flow [2024-11-20 17:19:35,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:19:35,725 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:19:35,725 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:19:35,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-20 17:19:35,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:19:35,927 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-20 17:19:35,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:19:35,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1256830863, now seen corresponding path program 1 times [2024-11-20 17:19:35,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:19:35,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523826060] [2024-11-20 17:19:35,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:19:35,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:19:35,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:19:35,931 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:19:35,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 17:19:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:19:36,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:19:36,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:19:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:19:36,096 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:19:36,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:19:36,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523826060] [2024-11-20 17:19:36,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [523826060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:19:36,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:19:36,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:19:36,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864129473] [2024-11-20 17:19:36,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:19:36,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:19:36,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:19:36,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:19:36,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:19:36,139 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-11-20 17:19:36,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:19:36,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:19:36,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-11-20 17:19:36,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:19:36,424 INFO L124 PetriNetUnfolderBase]: 687/1157 cut-off events. [2024-11-20 17:19:36,424 INFO L125 PetriNetUnfolderBase]: For 850/850 co-relation queries the response was YES. [2024-11-20 17:19:36,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2929 conditions, 1157 events. 687/1157 cut-off events. For 850/850 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5423 event pairs, 113 based on Foata normal form. 44/1166 useless extension candidates. Maximal degree in co-relation 2915. Up to 364 conditions per place. [2024-11-20 17:19:36,433 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 50 selfloop transitions, 11 changer transitions 1/76 dead transitions. [2024-11-20 17:19:36,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 76 transitions, 354 flow [2024-11-20 17:19:36,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:19:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:19:36,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2024-11-20 17:19:36,435 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5886524822695035 [2024-11-20 17:19:36,435 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 158 flow. Second operand 6 states and 166 transitions. [2024-11-20 17:19:36,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 76 transitions, 354 flow [2024-11-20 17:19:36,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 76 transitions, 329 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-20 17:19:36,441 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 172 flow [2024-11-20 17:19:36,441 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2024-11-20 17:19:36,446 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2024-11-20 17:19:36,446 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 172 flow [2024-11-20 17:19:36,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:19:36,446 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:19:36,446 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:19:36,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-20 17:19:36,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:19:36,647 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-20 17:19:36,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:19:36,648 INFO L85 PathProgramCache]: Analyzing trace with hash -819534112, now seen corresponding path program 1 times [2024-11-20 17:19:36,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:19:36,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886475274] [2024-11-20 17:19:36,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:19:36,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:19:36,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:19:36,649 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:19:36,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 17:19:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:19:36,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:19:36,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:19:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:19:36,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:19:36,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:19:36,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886475274] [2024-11-20 17:19:36,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886475274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:19:36,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:19:36,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:19:36,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896882486] [2024-11-20 17:19:36,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:19:36,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:19:36,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:19:36,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:19:36,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:19:36,791 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-11-20 17:19:36,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:19:36,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:19:36,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-11-20 17:19:36,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:19:36,910 INFO L124 PetriNetUnfolderBase]: 371/748 cut-off events. [2024-11-20 17:19:36,911 INFO L125 PetriNetUnfolderBase]: For 281/291 co-relation queries the response was YES. [2024-11-20 17:19:36,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1664 conditions, 748 events. 371/748 cut-off events. For 281/291 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3916 event pairs, 349 based on Foata normal form. 8/705 useless extension candidates. Maximal degree in co-relation 1649. Up to 576 conditions per place. [2024-11-20 17:19:36,916 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 19 selfloop transitions, 1 changer transitions 1/44 dead transitions. [2024-11-20 17:19:36,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 44 transitions, 212 flow [2024-11-20 17:19:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:19:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:19:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-11-20 17:19:36,917 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5815602836879432 [2024-11-20 17:19:36,917 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 172 flow. Second operand 3 states and 82 transitions. [2024-11-20 17:19:36,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 44 transitions, 212 flow [2024-11-20 17:19:36,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 44 transitions, 156 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-20 17:19:36,920 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 114 flow [2024-11-20 17:19:36,920 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2024-11-20 17:19:36,921 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2024-11-20 17:19:36,921 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 114 flow [2024-11-20 17:19:36,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:19:36,921 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:19:36,921 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:19:36,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-20 17:19:37,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:19:37,122 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-20 17:19:37,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:19:37,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1659657524, now seen corresponding path program 1 times [2024-11-20 17:19:37,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:19:37,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314737804] [2024-11-20 17:19:37,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:19:37,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:19:37,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:19:37,125 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:19:37,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 17:19:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:19:37,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 17:19:37,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:19:37,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:19:37,304 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:19:37,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:19:37,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314737804] [2024-11-20 17:19:37,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1314737804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:19:37,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:19:37,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 17:19:37,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531418476] [2024-11-20 17:19:37,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:19:37,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:19:37,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:19:37,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:19:37,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:19:37,324 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-20 17:19:37,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 114 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:19:37,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:19:37,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-20 17:19:37,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:19:37,688 INFO L124 PetriNetUnfolderBase]: 810/1516 cut-off events. [2024-11-20 17:19:37,689 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:19:37,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3020 conditions, 1516 events. 810/1516 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8497 event pairs, 238 based on Foata normal form. 8/1472 useless extension candidates. Maximal degree in co-relation 3013. Up to 677 conditions per place. [2024-11-20 17:19:37,698 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 30 selfloop transitions, 1 changer transitions 23/74 dead transitions. [2024-11-20 17:19:37,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 74 transitions, 288 flow [2024-11-20 17:19:37,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:19:37,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:19:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2024-11-20 17:19:37,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5780141843971631 [2024-11-20 17:19:37,700 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 114 flow. Second operand 6 states and 163 transitions. [2024-11-20 17:19:37,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 74 transitions, 288 flow [2024-11-20 17:19:37,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 287 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:19:37,702 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 124 flow [2024-11-20 17:19:37,702 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, 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=6, PETRI_FLOW=124, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2024-11-20 17:19:37,703 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2024-11-20 17:19:37,703 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 124 flow [2024-11-20 17:19:37,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:19:37,704 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:19:37,704 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:19:37,710 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-20 17:19:37,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:19:37,905 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-20 17:19:37,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:19:37,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1608618224, now seen corresponding path program 2 times [2024-11-20 17:19:37,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:19:37,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466562775] [2024-11-20 17:19:37,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:19:37,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:19:37,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:19:37,910 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:19:37,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-20 17:19:38,000 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 17:19:38,000 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:19:38,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-20 17:19:38,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:19:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:19:38,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:19:38,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:19:38,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466562775] [2024-11-20 17:19:38,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466562775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:19:38,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:19:38,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 17:19:38,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906189957] [2024-11-20 17:19:38,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:19:38,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 17:19:38,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:19:38,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 17:19:38,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:19:38,782 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-11-20 17:19:38,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 124 flow. Second operand has 10 states, 10 states have (on average 21.8) internal successors, (218), 10 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:19:38,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:19:38,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-11-20 17:19:38,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:19:39,191 INFO L124 PetriNetUnfolderBase]: 545/1054 cut-off events. [2024-11-20 17:19:39,191 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-20 17:19:39,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2146 conditions, 1054 events. 545/1054 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5662 event pairs, 100 based on Foata normal form. 8/1010 useless extension candidates. Maximal degree in co-relation 2135. Up to 236 conditions per place. [2024-11-20 17:19:39,196 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 40 selfloop transitions, 5 changer transitions 28/95 dead transitions. [2024-11-20 17:19:39,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 95 transitions, 390 flow [2024-11-20 17:19:39,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 17:19:39,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-20 17:19:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 274 transitions. [2024-11-20 17:19:39,198 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5829787234042553 [2024-11-20 17:19:39,198 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 124 flow. Second operand 10 states and 274 transitions. [2024-11-20 17:19:39,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 95 transitions, 390 flow [2024-11-20 17:19:39,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 95 transitions, 379 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-20 17:19:39,200 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 137 flow [2024-11-20 17:19:39,200 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=137, PETRI_PLACES=64, PETRI_TRANSITIONS=43} [2024-11-20 17:19:39,200 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2024-11-20 17:19:39,200 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 137 flow [2024-11-20 17:19:39,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.8) internal successors, (218), 10 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:19:39,201 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:19:39,201 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:19:39,207 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-20 17:19:39,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:19:39,405 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-20 17:19:39,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:19:39,406 INFO L85 PathProgramCache]: Analyzing trace with hash -625211310, now seen corresponding path program 3 times [2024-11-20 17:19:39,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:19:39,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238613532] [2024-11-20 17:19:39,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 17:19:39,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:19:39,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:19:39,409 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:19:39,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-20 17:19:39,497 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-20 17:19:39,497 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:19:39,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 17:19:39,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:19:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:19:39,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:19:39,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:19:39,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238613532] [2024-11-20 17:19:39,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238613532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:19:39,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:19:39,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 17:19:39,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228667618] [2024-11-20 17:19:39,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:19:39,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:19:39,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:19:39,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:19:39,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:19:39,561 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-20 17:19:39,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 43 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:19:39,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:19:39,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-20 17:19:39,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:19:39,830 INFO L124 PetriNetUnfolderBase]: 933/1757 cut-off events. [2024-11-20 17:19:39,830 INFO L125 PetriNetUnfolderBase]: For 438/438 co-relation queries the response was YES. [2024-11-20 17:19:39,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3844 conditions, 1757 events. 933/1757 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10248 event pairs, 249 based on Foata normal form. 8/1688 useless extension candidates. Maximal degree in co-relation 3831. Up to 649 conditions per place. [2024-11-20 17:19:39,837 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 25 selfloop transitions, 1 changer transitions 25/71 dead transitions. [2024-11-20 17:19:39,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 71 transitions, 318 flow [2024-11-20 17:19:39,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:19:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:19:39,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions. [2024-11-20 17:19:39,839 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5673758865248227 [2024-11-20 17:19:39,839 INFO L175 Difference]: Start difference. First operand has 64 places, 43 transitions, 137 flow. Second operand 6 states and 160 transitions. [2024-11-20 17:19:39,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 71 transitions, 318 flow [2024-11-20 17:19:39,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 284 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-11-20 17:19:39,843 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 132 flow [2024-11-20 17:19:39,843 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=132, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2024-11-20 17:19:39,844 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2024-11-20 17:19:39,845 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 132 flow [2024-11-20 17:19:39,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:19:39,845 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:19:39,845 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:19:39,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-20 17:19:40,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:19:40,049 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-20 17:19:40,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:19:40,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1525937984, now seen corresponding path program 4 times [2024-11-20 17:19:40,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:19:40,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850049292] [2024-11-20 17:19:40,050 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-20 17:19:40,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:19:40,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:19:40,054 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:19:40,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-20 17:19:40,135 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-20 17:19:40,135 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-20 17:19:40,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 17:19:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:19:40,225 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-20 17:19:40,226 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 17:19:40,226 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-20 17:19:40,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-20 17:19:40,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-20 17:19:40,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-20 17:19:40,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-20 17:19:40,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-20 17:19:40,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-20 17:19:40,236 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-20 17:19:40,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:19:40,429 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-20 17:19:40,509 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 17:19:40,509 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 17:19:40,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:19:40 BasicIcfg [2024-11-20 17:19:40,512 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 17:19:40,513 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 17:19:40,513 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 17:19:40,513 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 17:19:40,513 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:19:33" (3/4) ... [2024-11-20 17:19:40,515 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 17:19:40,515 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 17:19:40,516 INFO L158 Benchmark]: Toolchain (without parser) took 8651.98ms. Allocated memory was 65.0MB in the beginning and 446.7MB in the end (delta: 381.7MB). Free memory was 40.4MB in the beginning and 228.6MB in the end (delta: -188.1MB). Peak memory consumption was 191.7MB. Max. memory is 16.1GB. [2024-11-20 17:19:40,516 INFO L158 Benchmark]: CDTParser took 1.50ms. Allocated memory is still 65.0MB. Free memory was 41.5MB in the beginning and 41.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:19:40,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.06ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 40.1MB in the beginning and 50.9MB in the end (delta: -10.8MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2024-11-20 17:19:40,523 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.17ms. Allocated memory is still 86.0MB. Free memory was 50.9MB in the beginning and 48.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 17:19:40,523 INFO L158 Benchmark]: Boogie Preprocessor took 70.13ms. Allocated memory is still 86.0MB. Free memory was 48.2MB in the beginning and 44.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 17:19:40,523 INFO L158 Benchmark]: RCFGBuilder took 774.32ms. Allocated memory is still 86.0MB. Free memory was 44.4MB in the beginning and 46.2MB in the end (delta: -1.8MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-11-20 17:19:40,523 INFO L158 Benchmark]: TraceAbstraction took 7208.57ms. Allocated memory was 86.0MB in the beginning and 446.7MB in the end (delta: 360.7MB). Free memory was 45.6MB in the beginning and 228.6MB in the end (delta: -182.9MB). Peak memory consumption was 177.3MB. Max. memory is 16.1GB. [2024-11-20 17:19:40,523 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 446.7MB. Free memory is still 228.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:19:40,524 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.50ms. Allocated memory is still 65.0MB. Free memory was 41.5MB in the beginning and 41.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 514.06ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 40.1MB in the beginning and 50.9MB in the end (delta: -10.8MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.17ms. Allocated memory is still 86.0MB. Free memory was 50.9MB in the beginning and 48.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.13ms. Allocated memory is still 86.0MB. Free memory was 48.2MB in the beginning and 44.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 774.32ms. Allocated memory is still 86.0MB. Free memory was 44.4MB in the beginning and 46.2MB in the end (delta: -1.8MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7208.57ms. Allocated memory was 86.0MB in the beginning and 446.7MB in the end (delta: 360.7MB). Free memory was 45.6MB in the beginning and 228.6MB in the end (delta: -182.9MB). Peak memory consumption was 177.3MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 446.7MB. Free memory is still 228.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p1_EBX = 0; [L720] 0 int __unbuffered_p2_EAX = 0; [L722] 0 int __unbuffered_p2_EBX = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff1_thd0; [L738] 0 _Bool z$r_buff1_thd1; [L739] 0 _Bool z$r_buff1_thd2; [L740] 0 _Bool z$r_buff1_thd3; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t14; [L865] FCALL, FORK 0 pthread_create(&t14, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, t14=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] [L752] 1 z$w_buff1 = z$w_buff0 [L753] 1 z$w_buff0 = 1 [L754] 1 z$w_buff1_used = z$w_buff0_used [L755] 1 z$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L757] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L758] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L759] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L760] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L761] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L866] 0 pthread_t t15; [L867] FCALL, FORK 0 pthread_create(&t15, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, t14=0, t15=1, 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] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 z$flush_delayed = weak$$choice2 [L767] 1 z$mem_tmp = z [L768] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 __unbuffered_p0_EAX = z [L776] 1 z = z$flush_delayed ? z$mem_tmp : z [L777] 1 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, 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] [L780] 1 __unbuffered_p0_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, 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] [L797] 2 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, 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] [L800] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, 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] [L803] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, 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] [L868] 0 pthread_t t16; [L869] FCALL, FORK 0 pthread_create(&t16, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t14=0, t15=1, t16=2, weak$$choice0=0, weak$$choice2=1, 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] [L806] 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) [L807] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L808] 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 [L809] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, 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] [L820] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, x=1, 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] [L823] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, x=1, 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] [L826] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 3 z$flush_delayed = weak$$choice2 [L829] 3 z$mem_tmp = z [L830] 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) [L831] 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)) [L832] 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)) [L833] 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)) [L834] 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)) [L835] 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)) [L836] 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)) [L837] 3 __unbuffered_p2_EBX = z [L838] 3 z = z$flush_delayed ? z$mem_tmp : z [L839] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, 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] [L842] 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) [L843] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L844] 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 [L845] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L846] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, 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] [L783] 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) [L784] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L785] 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 [L786] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L787] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, 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] [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, 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] [L813] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, 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] [L849] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, 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] [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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, t14=0, t15=1, t16=2, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 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) [L876] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L877] 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 [L878] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L879] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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, t14=0, t15=1, t16=2, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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, t14=0, t15=1, t16=2, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, 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] [L18] 0 __assert_fail ("0", "mix001.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=1, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 867]: 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: 865]: 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: 869]: 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, 74 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: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 361 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 343 mSDsluCounter, 98 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1201 IncrementalHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 4 mSDtfsCounter, 1201 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=4, InterpolantAutomatonStates: 43, 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, 1.2s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 868 SizeOfPredicates, 16 NumberOfNonLiveVariables, 987 ConjunctsInSsa, 52 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-20 17:19:40,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample