./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/mix032.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 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/mix032.opt.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 0032fd1b0879d5a3b3f4ef67d0327f489d9a349f94447e8a77b1324c1477f2bb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:30:48,467 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:30:48,536 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:30:48,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:30:48,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:30:48,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:30:48,572 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:30:48,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:30:48,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:30:48,577 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:30:48,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:30:48,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:30:48,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:30:48,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:30:48,578 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:30:48,578 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:30:48,578 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:30:48,579 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:30:48,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:30:48,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:30:48,583 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:30:48,583 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:30:48,584 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:30:48,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:30:48,584 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:30:48,584 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:30:48,584 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:30:48,584 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:30:48,585 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:30:48,585 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:30:48,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:30:48,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:30:48,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:30:48,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:30:48,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:30:48,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:30:48,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:30:48,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:30:48,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:30:48,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:30:48,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:30:48,590 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:30:48,590 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 -> 0032fd1b0879d5a3b3f4ef67d0327f489d9a349f94447e8a77b1324c1477f2bb [2024-10-14 19:30:48,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:30:48,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:30:48,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:30:48,860 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:30:48,860 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:30:48,861 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix032.opt.i [2024-10-14 19:30:50,346 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:30:50,550 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:30:50,551 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix032.opt.i [2024-10-14 19:30:50,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f5c4657f/8a3d967081b84bc8b1dfcff68c05cbce/FLAG7788ab18e [2024-10-14 19:30:50,578 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f5c4657f/8a3d967081b84bc8b1dfcff68c05cbce [2024-10-14 19:30:50,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:30:50,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:30:50,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:30:50,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:30:50,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:30:50,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:30:50" (1/1) ... [2024-10-14 19:30:50,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54bae75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:30:50, skipping insertion in model container [2024-10-14 19:30:50,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:30:50" (1/1) ... [2024-10-14 19:30:50,614 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:30:50,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:30:50,915 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:30:50,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:30:51,016 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:30:51,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:30:51 WrapperNode [2024-10-14 19:30:51,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:30:51,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:30:51,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:30:51,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:30:51,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:30:51" (1/1) ... [2024-10-14 19:30:51,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:30:51" (1/1) ... [2024-10-14 19:30:51,086 INFO L138 Inliner]: procedures = 175, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 130 [2024-10-14 19:30:51,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:30:51,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:30:51,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:30:51,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:30:51,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:30:51" (1/1) ... [2024-10-14 19:30:51,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:30:51" (1/1) ... [2024-10-14 19:30:51,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:30:51" (1/1) ... [2024-10-14 19:30:51,160 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-10-14 19:30:51,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:30:51" (1/1) ... [2024-10-14 19:30:51,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:30:51" (1/1) ... [2024-10-14 19:30:51,165 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:30:51" (1/1) ... [2024-10-14 19:30:51,166 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:30:51" (1/1) ... [2024-10-14 19:30:51,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:30:51" (1/1) ... [2024-10-14 19:30:51,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:30:51" (1/1) ... [2024-10-14 19:30:51,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:30:51,171 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:30:51,171 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:30:51,171 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:30:51,172 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:30:51" (1/1) ... [2024-10-14 19:30:51,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:30:51,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:30:51,204 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-10-14 19:30:51,206 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-10-14 19:30:51,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 19:30:51,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:30:51,240 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-14 19:30:51,240 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-14 19:30:51,240 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-14 19:30:51,240 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-14 19:30:51,240 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-14 19:30:51,241 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-14 19:30:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 19:30:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 19:30:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:30:51,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:30:51,242 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 19:30:51,361 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:30:51,362 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:30:51,597 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 19:30:51,598 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:30:51,758 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:30:51,758 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 19:30:51,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:30:51 BoogieIcfgContainer [2024-10-14 19:30:51,759 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:30:51,762 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:30:51,762 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:30:51,764 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:30:51,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:30:50" (1/3) ... [2024-10-14 19:30:51,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7640fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:30:51, skipping insertion in model container [2024-10-14 19:30:51,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:30:51" (2/3) ... [2024-10-14 19:30:51,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7640fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:30:51, skipping insertion in model container [2024-10-14 19:30:51,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:30:51" (3/3) ... [2024-10-14 19:30:51,767 INFO L112 eAbstractionObserver]: Analyzing ICFG mix032.opt.i [2024-10-14 19:30:51,782 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:30:51,782 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-14 19:30:51,782 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 19:30:51,826 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-14 19:30:51,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 108 flow [2024-10-14 19:30:51,871 INFO L124 PetriNetUnfolderBase]: 2/45 cut-off events. [2024-10-14 19:30:51,872 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:30:51,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 45 events. 2/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-10-14 19:30:51,874 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 48 transitions, 108 flow [2024-10-14 19:30:51,876 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 45 transitions, 99 flow [2024-10-14 19:30:51,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:30:51,891 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;@6e61916, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:30:51,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-14 19:30:51,897 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 19:30:51,899 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2024-10-14 19:30:51,899 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:30:51,899 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:30:51,899 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:30:51,900 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:30:51,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:30:51,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1372056055, now seen corresponding path program 1 times [2024-10-14 19:30:51,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:30:51,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730989836] [2024-10-14 19:30:51,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:30:51,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:30:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:30:52,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:30:52,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:30:52,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730989836] [2024-10-14 19:30:52,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730989836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:30:52,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:30:52,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:30:52,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955423450] [2024-10-14 19:30:52,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:30:52,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:30:52,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:30:52,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:30:52,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:30:52,379 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 48 [2024-10-14 19:30:52,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-10-14 19:30:52,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:30:52,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 48 [2024-10-14 19:30:52,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:30:52,630 INFO L124 PetriNetUnfolderBase]: 361/789 cut-off events. [2024-10-14 19:30:52,630 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:30:52,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1382 conditions, 789 events. 361/789 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5046 event pairs, 131 based on Foata normal form. 48/816 useless extension candidates. Maximal degree in co-relation 1371. Up to 439 conditions per place. [2024-10-14 19:30:52,638 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 25 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2024-10-14 19:30:52,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 51 transitions, 169 flow [2024-10-14 19:30:52,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:30:52,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:30:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-10-14 19:30:52,648 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2024-10-14 19:30:52,649 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 99 flow. Second operand 3 states and 109 transitions. [2024-10-14 19:30:52,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 51 transitions, 169 flow [2024-10-14 19:30:52,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 51 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 19:30:52,653 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 90 flow [2024-10-14 19:30:52,655 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-10-14 19:30:52,659 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-10-14 19:30:52,659 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 90 flow [2024-10-14 19:30:52,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-10-14 19:30:52,659 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:30:52,659 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:30:52,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 19:30:52,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:30:52,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:30:52,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1542742937, now seen corresponding path program 1 times [2024-10-14 19:30:52,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:30:52,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700747782] [2024-10-14 19:30:52,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:30:52,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:30:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:30:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:30:52,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:30:52,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700747782] [2024-10-14 19:30:52,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700747782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:30:52,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:30:52,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:30:52,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077290646] [2024-10-14 19:30:52,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:30:52,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:30:52,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:30:52,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:30:52,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:30:52,744 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 48 [2024-10-14 19:30:52,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:30:52,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:30:52,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 48 [2024-10-14 19:30:52,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:30:52,887 INFO L124 PetriNetUnfolderBase]: 315/667 cut-off events. [2024-10-14 19:30:52,888 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-10-14 19:30:52,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 667 events. 315/667 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4513 event pairs, 315 based on Foata normal form. 24/650 useless extension candidates. Maximal degree in co-relation 1221. Up to 500 conditions per place. [2024-10-14 19:30:52,892 INFO L140 encePairwiseOnDemand]: 46/48 looper letters, 16 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-10-14 19:30:52,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 124 flow [2024-10-14 19:30:52,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:30:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:30:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2024-10-14 19:30:52,894 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6319444444444444 [2024-10-14 19:30:52,894 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 90 flow. Second operand 3 states and 91 transitions. [2024-10-14 19:30:52,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 124 flow [2024-10-14 19:30:52,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:30:52,896 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 84 flow [2024-10-14 19:30:52,896 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-10-14 19:30:52,897 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2024-10-14 19:30:52,897 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 84 flow [2024-10-14 19:30:52,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:30:52,898 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:30:52,898 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:30:52,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 19:30:52,898 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:30:52,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:30:52,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1542744550, now seen corresponding path program 1 times [2024-10-14 19:30:52,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:30:52,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245181190] [2024-10-14 19:30:52,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:30:52,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:30:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:30:53,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:30:53,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:30:53,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245181190] [2024-10-14 19:30:53,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245181190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:30:53,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:30:53,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:30:53,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213007611] [2024-10-14 19:30:53,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:30:53,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:30:53,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:30:53,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:30:53,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:30:53,141 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-10-14 19:30:53,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-10-14 19:30:53,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:30:53,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-10-14 19:30:53,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:30:53,809 INFO L124 PetriNetUnfolderBase]: 1655/2843 cut-off events. [2024-10-14 19:30:53,810 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:30:53,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5349 conditions, 2843 events. 1655/2843 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 18904 event pairs, 751 based on Foata normal form. 0/2736 useless extension candidates. Maximal degree in co-relation 5343. Up to 1597 conditions per place. [2024-10-14 19:30:53,830 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 29 selfloop transitions, 4 changer transitions 44/92 dead transitions. [2024-10-14 19:30:53,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 92 transitions, 350 flow [2024-10-14 19:30:53,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 19:30:53,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-14 19:30:53,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 231 transitions. [2024-10-14 19:30:53,835 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6015625 [2024-10-14 19:30:53,835 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 84 flow. Second operand 8 states and 231 transitions. [2024-10-14 19:30:53,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 92 transitions, 350 flow [2024-10-14 19:30:53,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 92 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:30:53,840 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 127 flow [2024-10-14 19:30:53,840 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=127, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2024-10-14 19:30:53,841 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2024-10-14 19:30:53,841 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 127 flow [2024-10-14 19:30:53,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-10-14 19:30:53,841 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:30:53,841 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:30:53,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 19:30:53,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:30:53,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:30:53,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1901650260, now seen corresponding path program 1 times [2024-10-14 19:30:53,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:30:53,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192913892] [2024-10-14 19:30:53,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:30:53,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:30:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:30:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:30:54,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:30:54,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192913892] [2024-10-14 19:30:54,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192913892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:30:54,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:30:54,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:30:54,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108885969] [2024-10-14 19:30:54,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:30:54,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:30:54,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:30:54,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:30:54,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:30:54,108 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-10-14 19:30:54,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 127 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:30:54,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:30:54,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-10-14 19:30:54,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:30:54,433 INFO L124 PetriNetUnfolderBase]: 1198/2161 cut-off events. [2024-10-14 19:30:54,433 INFO L125 PetriNetUnfolderBase]: For 2086/2086 co-relation queries the response was YES. [2024-10-14 19:30:54,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5577 conditions, 2161 events. 1198/2161 cut-off events. For 2086/2086 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 14178 event pairs, 259 based on Foata normal form. 64/2188 useless extension candidates. Maximal degree in co-relation 5565. Up to 1264 conditions per place. [2024-10-14 19:30:54,444 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 34 selfloop transitions, 3 changer transitions 37/89 dead transitions. [2024-10-14 19:30:54,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 89 transitions, 457 flow [2024-10-14 19:30:54,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 19:30:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-14 19:30:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2024-10-14 19:30:54,445 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6130952380952381 [2024-10-14 19:30:54,446 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 127 flow. Second operand 7 states and 206 transitions. [2024-10-14 19:30:54,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 89 transitions, 457 flow [2024-10-14 19:30:54,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 445 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-10-14 19:30:54,456 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 138 flow [2024-10-14 19:30:54,456 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=138, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2024-10-14 19:30:54,457 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2024-10-14 19:30:54,458 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 138 flow [2024-10-14 19:30:54,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:30:54,458 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:30:54,458 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:30:54,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 19:30:54,459 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:30:54,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:30:54,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1203019420, now seen corresponding path program 1 times [2024-10-14 19:30:54,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:30:54,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286885386] [2024-10-14 19:30:54,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:30:54,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:30:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:30:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:30:54,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:30:54,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286885386] [2024-10-14 19:30:54,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286885386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:30:54,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:30:54,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:30:54,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73614586] [2024-10-14 19:30:54,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:30:54,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:30:54,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:30:54,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:30:54,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:30:54,634 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-10-14 19:30:54,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:30:54,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:30:54,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-10-14 19:30:54,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:30:54,953 INFO L124 PetriNetUnfolderBase]: 1038/1796 cut-off events. [2024-10-14 19:30:54,953 INFO L125 PetriNetUnfolderBase]: For 2495/2495 co-relation queries the response was YES. [2024-10-14 19:30:54,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4971 conditions, 1796 events. 1038/1796 cut-off events. For 2495/2495 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10908 event pairs, 250 based on Foata normal form. 54/1819 useless extension candidates. Maximal degree in co-relation 4955. Up to 942 conditions per place. [2024-10-14 19:30:54,962 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 30 selfloop transitions, 3 changer transitions 29/77 dead transitions. [2024-10-14 19:30:54,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 77 transitions, 403 flow [2024-10-14 19:30:54,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 19:30:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-14 19:30:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions. [2024-10-14 19:30:54,964 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5773809523809523 [2024-10-14 19:30:54,964 INFO L175 Difference]: Start difference. First operand has 60 places, 40 transitions, 138 flow. Second operand 7 states and 194 transitions. [2024-10-14 19:30:54,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 77 transitions, 403 flow [2024-10-14 19:30:54,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 77 transitions, 379 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-10-14 19:30:54,971 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 143 flow [2024-10-14 19:30:54,972 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=143, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2024-10-14 19:30:54,973 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2024-10-14 19:30:54,974 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 143 flow [2024-10-14 19:30:54,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:30:54,974 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:30:54,974 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] [2024-10-14 19:30:54,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 19:30:54,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:30:54,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:30:54,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1318627477, now seen corresponding path program 1 times [2024-10-14 19:30:54,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:30:54,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262771015] [2024-10-14 19:30:54,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:30:54,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:30:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:30:55,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:30:55,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:30:55,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262771015] [2024-10-14 19:30:55,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262771015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:30:55,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:30:55,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:30:55,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123559315] [2024-10-14 19:30:55,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:30:55,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:30:55,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:30:55,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:30:55,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:30:55,096 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-10-14 19:30:55,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 143 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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-10-14 19:30:55,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:30:55,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-10-14 19:30:55,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:30:55,307 INFO L124 PetriNetUnfolderBase]: 1170/2016 cut-off events. [2024-10-14 19:30:55,307 INFO L125 PetriNetUnfolderBase]: For 852/884 co-relation queries the response was YES. [2024-10-14 19:30:55,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4527 conditions, 2016 events. 1170/2016 cut-off events. For 852/884 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 12203 event pairs, 178 based on Foata normal form. 90/2046 useless extension candidates. Maximal degree in co-relation 4510. Up to 1028 conditions per place. [2024-10-14 19:30:55,317 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 37 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2024-10-14 19:30:55,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 61 transitions, 273 flow [2024-10-14 19:30:55,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:30:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:30:55,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2024-10-14 19:30:55,318 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-10-14 19:30:55,319 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 143 flow. Second operand 4 states and 128 transitions. [2024-10-14 19:30:55,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 61 transitions, 273 flow [2024-10-14 19:30:55,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 259 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-10-14 19:30:55,323 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 167 flow [2024-10-14 19:30:55,323 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-10-14 19:30:55,324 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2024-10-14 19:30:55,325 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 167 flow [2024-10-14 19:30:55,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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-10-14 19:30:55,325 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:30:55,325 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:30:55,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 19:30:55,326 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:30:55,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:30:55,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1500414669, now seen corresponding path program 1 times [2024-10-14 19:30:55,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:30:55,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503633879] [2024-10-14 19:30:55,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:30:55,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:30:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:30:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:30:55,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:30:55,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503633879] [2024-10-14 19:30:55,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503633879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:30:55,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:30:55,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:30:55,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933571155] [2024-10-14 19:30:55,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:30:55,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:30:55,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:30:55,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:30:55,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:30:55,525 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-10-14 19:30:55,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 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-10-14 19:30:55,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:30:55,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-10-14 19:30:55,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:30:55,711 INFO L124 PetriNetUnfolderBase]: 904/1594 cut-off events. [2024-10-14 19:30:55,712 INFO L125 PetriNetUnfolderBase]: For 664/674 co-relation queries the response was YES. [2024-10-14 19:30:55,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3967 conditions, 1594 events. 904/1594 cut-off events. For 664/674 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9111 event pairs, 117 based on Foata normal form. 78/1615 useless extension candidates. Maximal degree in co-relation 3952. Up to 513 conditions per place. [2024-10-14 19:30:55,719 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 47 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2024-10-14 19:30:55,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 358 flow [2024-10-14 19:30:55,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:30:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:30:55,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2024-10-14 19:30:55,720 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-10-14 19:30:55,720 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 167 flow. Second operand 5 states and 162 transitions. [2024-10-14 19:30:55,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 358 flow [2024-10-14 19:30:55,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 74 transitions, 355 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:30:55,723 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 219 flow [2024-10-14 19:30:55,723 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2024-10-14 19:30:55,723 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2024-10-14 19:30:55,724 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 219 flow [2024-10-14 19:30:55,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 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-10-14 19:30:55,724 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:30:55,724 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] [2024-10-14 19:30:55,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 19:30:55,724 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:30:55,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:30:55,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1930489078, now seen corresponding path program 1 times [2024-10-14 19:30:55,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:30:55,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415411590] [2024-10-14 19:30:55,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:30:55,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:30:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:30:55,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:30:55,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:30:55,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415411590] [2024-10-14 19:30:55,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415411590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:30:55,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:30:55,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:30:55,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997276] [2024-10-14 19:30:55,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:30:55,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:30:55,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:30:55,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:30:55,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:30:55,911 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-10-14 19:30:55,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 219 flow. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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-10-14 19:30:55,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:30:55,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-10-14 19:30:55,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:30:56,219 INFO L124 PetriNetUnfolderBase]: 684/1198 cut-off events. [2024-10-14 19:30:56,219 INFO L125 PetriNetUnfolderBase]: For 1454/1456 co-relation queries the response was YES. [2024-10-14 19:30:56,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3435 conditions, 1198 events. 684/1198 cut-off events. For 1454/1456 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6479 event pairs, 105 based on Foata normal form. 40/1181 useless extension candidates. Maximal degree in co-relation 3417. Up to 454 conditions per place. [2024-10-14 19:30:56,228 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 43 selfloop transitions, 11 changer transitions 0/73 dead transitions. [2024-10-14 19:30:56,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 73 transitions, 388 flow [2024-10-14 19:30:56,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:30:56,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:30:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2024-10-14 19:30:56,233 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6319444444444444 [2024-10-14 19:30:56,233 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 219 flow. Second operand 6 states and 182 transitions. [2024-10-14 19:30:56,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 73 transitions, 388 flow [2024-10-14 19:30:56,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 73 transitions, 359 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-10-14 19:30:56,235 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 235 flow [2024-10-14 19:30:56,236 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=235, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2024-10-14 19:30:56,236 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2024-10-14 19:30:56,240 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 235 flow [2024-10-14 19:30:56,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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-10-14 19:30:56,240 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:30:56,241 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:30:56,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 19:30:56,241 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:30:56,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:30:56,241 INFO L85 PathProgramCache]: Analyzing trace with hash -888276581, now seen corresponding path program 1 times [2024-10-14 19:30:56,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:30:56,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699285093] [2024-10-14 19:30:56,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:30:56,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:30:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:30:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:30:56,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:30:56,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699285093] [2024-10-14 19:30:56,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699285093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:30:56,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:30:56,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:30:56,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833897173] [2024-10-14 19:30:56,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:30:56,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:30:56,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:30:56,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:30:56,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:30:56,626 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-10-14 19:30:56,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 235 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-10-14 19:30:56,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:30:56,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-10-14 19:30:56,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:30:57,046 INFO L124 PetriNetUnfolderBase]: 958/1875 cut-off events. [2024-10-14 19:30:57,047 INFO L125 PetriNetUnfolderBase]: For 3157/3499 co-relation queries the response was YES. [2024-10-14 19:30:57,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5358 conditions, 1875 events. 958/1875 cut-off events. For 3157/3499 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 11760 event pairs, 211 based on Foata normal form. 39/1769 useless extension candidates. Maximal degree in co-relation 5340. Up to 922 conditions per place. [2024-10-14 19:30:57,059 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 47 selfloop transitions, 12 changer transitions 10/92 dead transitions. [2024-10-14 19:30:57,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 92 transitions, 509 flow [2024-10-14 19:30:57,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 19:30:57,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-14 19:30:57,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions. [2024-10-14 19:30:57,060 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5773809523809523 [2024-10-14 19:30:57,060 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 235 flow. Second operand 7 states and 194 transitions. [2024-10-14 19:30:57,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 92 transitions, 509 flow [2024-10-14 19:30:57,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 92 transitions, 457 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-10-14 19:30:57,070 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 275 flow [2024-10-14 19:30:57,070 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=275, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2024-10-14 19:30:57,071 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 16 predicate places. [2024-10-14 19:30:57,071 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 275 flow [2024-10-14 19:30:57,072 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-10-14 19:30:57,072 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:30:57,072 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:30:57,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 19:30:57,072 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:30:57,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:30:57,072 INFO L85 PathProgramCache]: Analyzing trace with hash -361589879, now seen corresponding path program 2 times [2024-10-14 19:30:57,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:30:57,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049157343] [2024-10-14 19:30:57,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:30:57,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:30:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:30:57,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:30:57,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:30:57,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049157343] [2024-10-14 19:30:57,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049157343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:30:57,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:30:57,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 19:30:57,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551391562] [2024-10-14 19:30:57,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:30:57,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 19:30:57,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:30:57,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 19:30:57,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-14 19:30:57,666 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-10-14 19:30:57,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 275 flow. Second operand has 10 states, 10 states have (on average 20.0) internal successors, (200), 10 states have internal predecessors, (200), 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-10-14 19:30:57,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:30:57,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-10-14 19:30:57,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:30:58,173 INFO L124 PetriNetUnfolderBase]: 1431/2834 cut-off events. [2024-10-14 19:30:58,173 INFO L125 PetriNetUnfolderBase]: For 3551/4050 co-relation queries the response was YES. [2024-10-14 19:30:58,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8029 conditions, 2834 events. 1431/2834 cut-off events. For 3551/4050 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 20060 event pairs, 238 based on Foata normal form. 55/2653 useless extension candidates. Maximal degree in co-relation 8009. Up to 1188 conditions per place. [2024-10-14 19:30:58,190 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 55 selfloop transitions, 21 changer transitions 32/131 dead transitions. [2024-10-14 19:30:58,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 131 transitions, 818 flow [2024-10-14 19:30:58,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 19:30:58,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-14 19:30:58,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 308 transitions. [2024-10-14 19:30:58,191 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2024-10-14 19:30:58,192 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 275 flow. Second operand 12 states and 308 transitions. [2024-10-14 19:30:58,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 131 transitions, 818 flow [2024-10-14 19:30:58,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 131 transitions, 812 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-10-14 19:30:58,205 INFO L231 Difference]: Finished difference. Result has 83 places, 71 transitions, 431 flow [2024-10-14 19:30:58,205 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=431, PETRI_PLACES=83, PETRI_TRANSITIONS=71} [2024-10-14 19:30:58,207 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 30 predicate places. [2024-10-14 19:30:58,207 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 71 transitions, 431 flow [2024-10-14 19:30:58,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.0) internal successors, (200), 10 states have internal predecessors, (200), 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-10-14 19:30:58,207 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:30:58,207 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:30:58,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 19:30:58,208 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:30:58,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:30:58,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1237011981, now seen corresponding path program 3 times [2024-10-14 19:30:58,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:30:58,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999253223] [2024-10-14 19:30:58,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:30:58,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:30:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:30:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:30:58,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:30:58,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999253223] [2024-10-14 19:30:58,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999253223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:30:58,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:30:58,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 19:30:58,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717580193] [2024-10-14 19:30:58,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:30:58,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 19:30:58,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:30:58,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 19:30:58,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:30:58,408 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-10-14 19:30:58,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 431 flow. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 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-10-14 19:30:58,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:30:58,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-10-14 19:30:58,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:30:58,800 INFO L124 PetriNetUnfolderBase]: 1296/2599 cut-off events. [2024-10-14 19:30:58,800 INFO L125 PetriNetUnfolderBase]: For 3720/4009 co-relation queries the response was YES. [2024-10-14 19:30:58,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7865 conditions, 2599 events. 1296/2599 cut-off events. For 3720/4009 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 18367 event pairs, 349 based on Foata normal form. 51/2430 useless extension candidates. Maximal degree in co-relation 7838. Up to 887 conditions per place. [2024-10-14 19:30:58,811 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 37 selfloop transitions, 6 changer transitions 49/115 dead transitions. [2024-10-14 19:30:58,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 115 transitions, 782 flow [2024-10-14 19:30:58,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 19:30:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-14 19:30:58,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 215 transitions. [2024-10-14 19:30:58,812 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5598958333333334 [2024-10-14 19:30:58,812 INFO L175 Difference]: Start difference. First operand has 83 places, 71 transitions, 431 flow. Second operand 8 states and 215 transitions. [2024-10-14 19:30:58,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 115 transitions, 782 flow [2024-10-14 19:30:58,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 115 transitions, 759 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-10-14 19:30:58,823 INFO L231 Difference]: Finished difference. Result has 84 places, 57 transitions, 303 flow [2024-10-14 19:30:58,823 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=303, PETRI_PLACES=84, PETRI_TRANSITIONS=57} [2024-10-14 19:30:58,824 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 31 predicate places. [2024-10-14 19:30:58,824 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 57 transitions, 303 flow [2024-10-14 19:30:58,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 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-10-14 19:30:58,824 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:30:58,825 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:30:58,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 19:30:58,826 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:30:58,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:30:58,827 INFO L85 PathProgramCache]: Analyzing trace with hash 248859019, now seen corresponding path program 4 times [2024-10-14 19:30:58,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:30:58,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838269503] [2024-10-14 19:30:58,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:30:58,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:30:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:30:58,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:30:58,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:30:58,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838269503] [2024-10-14 19:30:58,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838269503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:30:58,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:30:58,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:30:58,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895463317] [2024-10-14 19:30:58,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:30:58,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:30:58,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:30:58,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:30:58,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:30:58,991 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-10-14 19:30:58,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 57 transitions, 303 flow. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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-10-14 19:30:58,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:30:58,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-10-14 19:30:58,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:30:59,224 INFO L124 PetriNetUnfolderBase]: 797/1780 cut-off events. [2024-10-14 19:30:59,225 INFO L125 PetriNetUnfolderBase]: For 2015/2259 co-relation queries the response was YES. [2024-10-14 19:30:59,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4957 conditions, 1780 events. 797/1780 cut-off events. For 2015/2259 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12681 event pairs, 173 based on Foata normal form. 29/1614 useless extension candidates. Maximal degree in co-relation 4930. Up to 519 conditions per place. [2024-10-14 19:30:59,231 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 26 selfloop transitions, 1 changer transitions 36/90 dead transitions. [2024-10-14 19:30:59,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 90 transitions, 552 flow [2024-10-14 19:30:59,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:30:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:30:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2024-10-14 19:30:59,233 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2024-10-14 19:30:59,233 INFO L175 Difference]: Start difference. First operand has 84 places, 57 transitions, 303 flow. Second operand 6 states and 174 transitions. [2024-10-14 19:30:59,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 90 transitions, 552 flow [2024-10-14 19:30:59,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 90 transitions, 514 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-10-14 19:30:59,238 INFO L231 Difference]: Finished difference. Result has 79 places, 50 transitions, 247 flow [2024-10-14 19:30:59,238 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=247, PETRI_PLACES=79, PETRI_TRANSITIONS=50} [2024-10-14 19:30:59,239 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2024-10-14 19:30:59,240 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 50 transitions, 247 flow [2024-10-14 19:30:59,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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-10-14 19:30:59,240 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:30:59,240 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:30:59,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 19:30:59,240 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:30:59,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:30:59,241 INFO L85 PathProgramCache]: Analyzing trace with hash -691947583, now seen corresponding path program 5 times [2024-10-14 19:30:59,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:30:59,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981766256] [2024-10-14 19:30:59,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:30:59,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:30:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:30:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:30:59,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:30:59,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981766256] [2024-10-14 19:30:59,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981766256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:30:59,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:30:59,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 19:30:59,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522384014] [2024-10-14 19:30:59,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:30:59,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 19:30:59,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:30:59,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 19:30:59,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 19:30:59,731 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 48 [2024-10-14 19:30:59,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 50 transitions, 247 flow. Second operand has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 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-10-14 19:30:59,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:30:59,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 48 [2024-10-14 19:30:59,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:30:59,960 INFO L124 PetriNetUnfolderBase]: 415/990 cut-off events. [2024-10-14 19:30:59,960 INFO L125 PetriNetUnfolderBase]: For 1048/1235 co-relation queries the response was YES. [2024-10-14 19:30:59,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2677 conditions, 990 events. 415/990 cut-off events. For 1048/1235 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6203 event pairs, 114 based on Foata normal form. 24/892 useless extension candidates. Maximal degree in co-relation 2653. Up to 327 conditions per place. [2024-10-14 19:30:59,964 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 18 selfloop transitions, 3 changer transitions 25/73 dead transitions. [2024-10-14 19:30:59,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 73 transitions, 397 flow [2024-10-14 19:30:59,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 19:30:59,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-14 19:30:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 251 transitions. [2024-10-14 19:30:59,966 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5810185185185185 [2024-10-14 19:30:59,966 INFO L175 Difference]: Start difference. First operand has 79 places, 50 transitions, 247 flow. Second operand 9 states and 251 transitions. [2024-10-14 19:30:59,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 73 transitions, 397 flow [2024-10-14 19:30:59,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 73 transitions, 374 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-10-14 19:30:59,970 INFO L231 Difference]: Finished difference. Result has 80 places, 45 transitions, 217 flow [2024-10-14 19:30:59,971 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=217, PETRI_PLACES=80, PETRI_TRANSITIONS=45} [2024-10-14 19:30:59,971 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 27 predicate places. [2024-10-14 19:30:59,971 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 45 transitions, 217 flow [2024-10-14 19:30:59,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 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-10-14 19:30:59,972 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:30:59,972 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:30:59,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 19:30:59,972 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:30:59,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:30:59,973 INFO L85 PathProgramCache]: Analyzing trace with hash -39757041, now seen corresponding path program 6 times [2024-10-14 19:30:59,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:30:59,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242933239] [2024-10-14 19:30:59,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:30:59,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:31:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:31:00,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 19:31:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:31:00,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 19:31:00,075 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 19:31:00,076 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-10-14 19:31:00,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-14 19:31:00,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-14 19:31:00,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-14 19:31:00,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-14 19:31:00,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-14 19:31:00,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-14 19:31:00,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 19:31:00,079 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:31:00,150 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 19:31:00,150 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 19:31:00,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:31:00 BasicIcfg [2024-10-14 19:31:00,161 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 19:31:00,161 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 19:31:00,162 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 19:31:00,162 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 19:31:00,162 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:30:51" (3/4) ... [2024-10-14 19:31:00,163 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 19:31:00,164 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 19:31:00,165 INFO L158 Benchmark]: Toolchain (without parser) took 9583.84ms. Allocated memory was 169.9MB in the beginning and 612.4MB in the end (delta: 442.5MB). Free memory was 100.5MB in the beginning and 352.6MB in the end (delta: -252.1MB). Peak memory consumption was 190.9MB. Max. memory is 16.1GB. [2024-10-14 19:31:00,165 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 169.9MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:31:00,165 INFO L158 Benchmark]: CACSL2BoogieTranslator took 435.01ms. Allocated memory is still 169.9MB. Free memory was 100.2MB in the beginning and 75.8MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-14 19:31:00,165 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.97ms. Allocated memory is still 169.9MB. Free memory was 75.8MB in the beginning and 140.6MB in the end (delta: -64.7MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2024-10-14 19:31:00,169 INFO L158 Benchmark]: Boogie Preprocessor took 83.02ms. Allocated memory is still 169.9MB. Free memory was 140.6MB in the beginning and 137.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 19:31:00,169 INFO L158 Benchmark]: RCFGBuilder took 587.91ms. Allocated memory is still 169.9MB. Free memory was 137.6MB in the beginning and 89.4MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-10-14 19:31:00,170 INFO L158 Benchmark]: TraceAbstraction took 8399.51ms. Allocated memory was 169.9MB in the beginning and 612.4MB in the end (delta: 442.5MB). Free memory was 88.6MB in the beginning and 352.6MB in the end (delta: -264.0MB). Peak memory consumption was 182.3MB. Max. memory is 16.1GB. [2024-10-14 19:31:00,170 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 612.4MB. Free memory is still 352.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:31:00,171 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.13ms. Allocated memory is still 169.9MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 435.01ms. Allocated memory is still 169.9MB. Free memory was 100.2MB in the beginning and 75.8MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.97ms. Allocated memory is still 169.9MB. Free memory was 75.8MB in the beginning and 140.6MB in the end (delta: -64.7MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.02ms. Allocated memory is still 169.9MB. Free memory was 140.6MB in the beginning and 137.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 587.91ms. Allocated memory is still 169.9MB. Free memory was 137.6MB in the beginning and 89.4MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8399.51ms. Allocated memory was 169.9MB in the beginning and 612.4MB in the end (delta: 442.5MB). Free memory was 88.6MB in the beginning and 352.6MB in the end (delta: -264.0MB). Peak memory consumption was 182.3MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 612.4MB. Free memory is still 352.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L723] 0 int b = 0; [L724] 0 _Bool main$tmp_guard0; [L725] 0 _Bool main$tmp_guard1; [L727] 0 int x = 0; [L729] 0 int y = 0; [L731] 0 int z = 0; [L732] 0 _Bool z$flush_delayed; [L733] 0 int z$mem_tmp; [L734] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd1; [L736] 0 _Bool z$r_buff0_thd2; [L737] 0 _Bool z$r_buff0_thd3; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$read_delayed; [L743] 0 int *z$read_delayed_var; [L744] 0 int z$w_buff0; [L745] 0 _Bool z$w_buff0_used; [L746] 0 int z$w_buff1; [L747] 0 _Bool z$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L845] 0 pthread_t t852; [L846] FCALL, FORK 0 pthread_create(&t852, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 0 pthread_t t853; [L848] FCALL, FORK 0 pthread_create(&t853, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852=-2, t853=-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] [L849] 0 pthread_t t854; [L850] FCALL, FORK 0 pthread_create(&t854, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852=-2, t853=-1, t854=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] [L802] 3 z$w_buff1 = z$w_buff0 [L803] 3 z$w_buff0 = 1 [L804] 3 z$w_buff1_used = z$w_buff0_used [L805] 3 z$w_buff0_used = (_Bool)1 [L806] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L806] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 3 z$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L814] 3 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L817] 3 __unbuffered_p2_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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 __unbuffered_p2_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L753] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L756] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L768] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L771] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L774] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 z$flush_delayed = weak$$choice2 [L780] 2 z$mem_tmp = z [L781] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L782] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L783] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L784] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L785] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L787] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 __unbuffered_p1_EBX = z [L789] 2 z = z$flush_delayed ? z$mem_tmp : z [L790] 2 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L824] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L825] 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 [L826] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L827] 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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t852=-2, t853=-1, t854=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] 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) [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 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 [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t852=-2, t853=-1, t854=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t852=-2, t853=-1, t854=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L865] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix032.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 843]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 76 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.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 556 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 514 mSDsluCounter, 285 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 217 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1558 IncrementalHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 68 mSDtfsCounter, 1558 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=431occurred in iteration=10, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 310 ConstructedInterpolants, 0 QuantifiedInterpolants, 2094 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-10-14 19:31:00,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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/mix032.opt.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 0032fd1b0879d5a3b3f4ef67d0327f489d9a349f94447e8a77b1324c1477f2bb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:31:02,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:31:02,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 19:31:02,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:31:02,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:31:02,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:31:02,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:31:02,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:31:02,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:31:02,579 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:31:02,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:31:02,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:31:02,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:31:02,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:31:02,581 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:31:02,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:31:02,586 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:31:02,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:31:02,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:31:02,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:31:02,586 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:31:02,589 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:31:02,589 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:31:02,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:31:02,589 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:31:02,589 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 19:31:02,590 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:31:02,590 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 19:31:02,590 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:31:02,590 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:31:02,590 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:31:02,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:31:02,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:31:02,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:31:02,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:31:02,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:31:02,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:31:02,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:31:02,591 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 19:31:02,591 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 19:31:02,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:31:02,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:31:02,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:31:02,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:31:02,593 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 19:31:02,593 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 -> 0032fd1b0879d5a3b3f4ef67d0327f489d9a349f94447e8a77b1324c1477f2bb [2024-10-14 19:31:02,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:31:02,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:31:02,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:31:02,883 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:31:02,885 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:31:02,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix032.opt.i [2024-10-14 19:31:04,480 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:31:04,704 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:31:04,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix032.opt.i [2024-10-14 19:31:04,725 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02d37925f/ab05094a0d624421b28006d1c305eca5/FLAGab9b4aa21 [2024-10-14 19:31:04,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02d37925f/ab05094a0d624421b28006d1c305eca5 [2024-10-14 19:31:04,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:31:04,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:31:04,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:31:04,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:31:04,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:31:04,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:31:04" (1/1) ... [2024-10-14 19:31:04,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d01c342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:04, skipping insertion in model container [2024-10-14 19:31:04,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:31:04" (1/1) ... [2024-10-14 19:31:04,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:31:05,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:31:05,335 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:31:05,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:31:05,403 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:31:05,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:05 WrapperNode [2024-10-14 19:31:05,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:31:05,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:31:05,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:31:05,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:31:05,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:05" (1/1) ... [2024-10-14 19:31:05,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:05" (1/1) ... [2024-10-14 19:31:05,443 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 131 [2024-10-14 19:31:05,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:31:05,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:31:05,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:31:05,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:31:05,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:05" (1/1) ... [2024-10-14 19:31:05,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:05" (1/1) ... [2024-10-14 19:31:05,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:05" (1/1) ... [2024-10-14 19:31:05,468 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-10-14 19:31:05,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:05" (1/1) ... [2024-10-14 19:31:05,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:05" (1/1) ... [2024-10-14 19:31:05,476 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:05" (1/1) ... [2024-10-14 19:31:05,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:05" (1/1) ... [2024-10-14 19:31:05,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:05" (1/1) ... [2024-10-14 19:31:05,480 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:05" (1/1) ... [2024-10-14 19:31:05,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:31:05,483 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:31:05,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:31:05,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:31:05,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:05" (1/1) ... [2024-10-14 19:31:05,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:31:05,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:31:05,512 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-10-14 19:31:05,514 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-10-14 19:31:05,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 19:31:05,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:31:05,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 19:31:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-14 19:31:05,553 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-14 19:31:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-14 19:31:05,553 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-14 19:31:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-14 19:31:05,553 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-14 19:31:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 19:31:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:31:05,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:31:05,555 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 19:31:05,670 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:31:05,672 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:31:05,977 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 19:31:05,981 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:31:06,176 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:31:06,176 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 19:31:06,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:31:06 BoogieIcfgContainer [2024-10-14 19:31:06,177 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:31:06,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:31:06,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:31:06,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:31:06,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:31:04" (1/3) ... [2024-10-14 19:31:06,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc80ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:31:06, skipping insertion in model container [2024-10-14 19:31:06,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:31:05" (2/3) ... [2024-10-14 19:31:06,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc80ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:31:06, skipping insertion in model container [2024-10-14 19:31:06,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:31:06" (3/3) ... [2024-10-14 19:31:06,188 INFO L112 eAbstractionObserver]: Analyzing ICFG mix032.opt.i [2024-10-14 19:31:06,200 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:31:06,200 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-14 19:31:06,200 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 19:31:06,249 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-14 19:31:06,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 108 flow [2024-10-14 19:31:06,314 INFO L124 PetriNetUnfolderBase]: 2/45 cut-off events. [2024-10-14 19:31:06,314 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:31:06,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 45 events. 2/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-10-14 19:31:06,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 48 transitions, 108 flow [2024-10-14 19:31:06,320 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 45 transitions, 99 flow [2024-10-14 19:31:06,326 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:31:06,330 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;@37400ec0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:31:06,330 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-14 19:31:06,335 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 19:31:06,335 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2024-10-14 19:31:06,335 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:31:06,335 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:31:06,335 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:31:06,336 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:31:06,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:31:06,340 INFO L85 PathProgramCache]: Analyzing trace with hash -347228407, now seen corresponding path program 1 times [2024-10-14 19:31:06,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:31:06,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371208562] [2024-10-14 19:31:06,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:31:06,353 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-10-14 19:31:06,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:31:06,359 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-10-14 19:31:06,360 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-10-14 19:31:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:31:06,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:31:06,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:31:06,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:31:06,472 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:31:06,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:31:06,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371208562] [2024-10-14 19:31:06,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371208562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:31:06,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:31:06,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:31:06,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636892183] [2024-10-14 19:31:06,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:31:06,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:31:06,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:31:06,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:31:06,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:31:06,507 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 48 [2024-10-14 19:31:06,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-10-14 19:31:06,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:31:06,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 48 [2024-10-14 19:31:06,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:31:06,694 INFO L124 PetriNetUnfolderBase]: 361/789 cut-off events. [2024-10-14 19:31:06,695 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:31:06,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1382 conditions, 789 events. 361/789 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5046 event pairs, 131 based on Foata normal form. 48/816 useless extension candidates. Maximal degree in co-relation 1371. Up to 439 conditions per place. [2024-10-14 19:31:06,704 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 25 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2024-10-14 19:31:06,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 51 transitions, 169 flow [2024-10-14 19:31:06,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:31:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:31:06,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-10-14 19:31:06,717 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2024-10-14 19:31:06,719 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 99 flow. Second operand 3 states and 109 transitions. [2024-10-14 19:31:06,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 51 transitions, 169 flow [2024-10-14 19:31:06,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 51 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 19:31:06,724 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 90 flow [2024-10-14 19:31:06,727 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-10-14 19:31:06,730 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-10-14 19:31:06,732 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 90 flow [2024-10-14 19:31:06,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-10-14 19:31:06,733 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:31:06,733 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:31:06,740 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-10-14 19:31:06,933 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-10-14 19:31:06,934 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:31:06,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:31:06,935 INFO L85 PathProgramCache]: Analyzing trace with hash 936045019, now seen corresponding path program 1 times [2024-10-14 19:31:06,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:31:06,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698410956] [2024-10-14 19:31:06,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:31:06,936 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-10-14 19:31:06,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:31:06,941 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-10-14 19:31:06,942 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-10-14 19:31:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:31:07,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:31:07,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:31:07,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:31:07,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:31:07,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:31:07,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698410956] [2024-10-14 19:31:07,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698410956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:31:07,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:31:07,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:31:07,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400121578] [2024-10-14 19:31:07,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:31:07,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:31:07,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:31:07,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:31:07,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:31:07,089 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-10-14 19:31:07,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-10-14 19:31:07,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:31:07,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-10-14 19:31:07,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:31:07,417 INFO L124 PetriNetUnfolderBase]: 1014/1836 cut-off events. [2024-10-14 19:31:07,418 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-10-14 19:31:07,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3517 conditions, 1836 events. 1014/1836 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 12190 event pairs, 94 based on Foata normal form. 60/1879 useless extension candidates. Maximal degree in co-relation 3507. Up to 1015 conditions per place. [2024-10-14 19:31:07,431 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 37 selfloop transitions, 5 changer transitions 1/61 dead transitions. [2024-10-14 19:31:07,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 226 flow [2024-10-14 19:31:07,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:31:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:31:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2024-10-14 19:31:07,434 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.671875 [2024-10-14 19:31:07,434 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 90 flow. Second operand 4 states and 129 transitions. [2024-10-14 19:31:07,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 226 flow [2024-10-14 19:31:07,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 61 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:31:07,439 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 120 flow [2024-10-14 19:31:07,440 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, 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=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2024-10-14 19:31:07,440 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2024-10-14 19:31:07,440 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 120 flow [2024-10-14 19:31:07,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-10-14 19:31:07,441 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:31:07,441 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:31:07,447 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-10-14 19:31:07,641 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-10-14 19:31:07,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:31:07,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:31:07,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2110244902, now seen corresponding path program 1 times [2024-10-14 19:31:07,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:31:07,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341242081] [2024-10-14 19:31:07,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:31:07,644 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-10-14 19:31:07,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:31:07,647 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-10-14 19:31:07,652 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-10-14 19:31:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:31:07,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:31:07,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:31:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:31:07,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:31:07,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:31:07,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341242081] [2024-10-14 19:31:07,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341242081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:31:07,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:31:07,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:31:07,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084566660] [2024-10-14 19:31:07,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:31:07,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:31:07,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:31:07,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:31:07,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:31:07,772 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-10-14 19:31:07,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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-10-14 19:31:07,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:31:07,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-10-14 19:31:07,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:31:07,958 INFO L124 PetriNetUnfolderBase]: 688/1262 cut-off events. [2024-10-14 19:31:07,959 INFO L125 PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES. [2024-10-14 19:31:07,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2805 conditions, 1262 events. 688/1262 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7392 event pairs, 34 based on Foata normal form. 54/1302 useless extension candidates. Maximal degree in co-relation 2793. Up to 553 conditions per place. [2024-10-14 19:31:07,965 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 46 selfloop transitions, 8 changer transitions 1/73 dead transitions. [2024-10-14 19:31:07,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 311 flow [2024-10-14 19:31:07,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:31:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:31:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2024-10-14 19:31:07,967 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-10-14 19:31:07,967 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 120 flow. Second operand 5 states and 162 transitions. [2024-10-14 19:31:07,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 311 flow [2024-10-14 19:31:07,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 73 transitions, 301 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-14 19:31:07,970 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 160 flow [2024-10-14 19:31:07,970 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-10-14 19:31:07,970 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2024-10-14 19:31:07,970 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 160 flow [2024-10-14 19:31:07,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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-10-14 19:31:07,971 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:31:07,971 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-10-14 19:31:07,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 19:31:08,177 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-10-14 19:31:08,182 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:31:08,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:31:08,182 INFO L85 PathProgramCache]: Analyzing trace with hash 111136072, now seen corresponding path program 1 times [2024-10-14 19:31:08,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:31:08,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030840139] [2024-10-14 19:31:08,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:31:08,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:31:08,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:31:08,186 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-10-14 19:31:08,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 19:31:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:31:08,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:31:08,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:31:08,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:31:08,316 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:31:08,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:31:08,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030840139] [2024-10-14 19:31:08,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030840139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:31:08,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:31:08,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:31:08,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987409446] [2024-10-14 19:31:08,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:31:08,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:31:08,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:31:08,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:31:08,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:31:08,331 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-10-14 19:31:08,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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-10-14 19:31:08,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:31:08,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-10-14 19:31:08,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:31:08,518 INFO L124 PetriNetUnfolderBase]: 369/657 cut-off events. [2024-10-14 19:31:08,519 INFO L125 PetriNetUnfolderBase]: For 574/574 co-relation queries the response was YES. [2024-10-14 19:31:08,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1715 conditions, 657 events. 369/657 cut-off events. For 574/574 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2923 event pairs, 23 based on Foata normal form. 32/675 useless extension candidates. Maximal degree in co-relation 1701. Up to 228 conditions per place. [2024-10-14 19:31:08,522 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 41 selfloop transitions, 11 changer transitions 1/71 dead transitions. [2024-10-14 19:31:08,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 326 flow [2024-10-14 19:31:08,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:31:08,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:31:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2024-10-14 19:31:08,524 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6284722222222222 [2024-10-14 19:31:08,524 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 160 flow. Second operand 6 states and 181 transitions. [2024-10-14 19:31:08,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 326 flow [2024-10-14 19:31:08,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 301 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-14 19:31:08,529 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 174 flow [2024-10-14 19:31:08,529 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2024-10-14 19:31:08,529 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2024-10-14 19:31:08,529 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 174 flow [2024-10-14 19:31:08,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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-10-14 19:31:08,530 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:31:08,530 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:31:08,538 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-10-14 19:31:08,733 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-10-14 19:31:08,733 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:31:08,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:31:08,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1866049864, now seen corresponding path program 1 times [2024-10-14 19:31:08,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:31:08,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067903180] [2024-10-14 19:31:08,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:31:08,734 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-10-14 19:31:08,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:31:08,737 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-10-14 19:31:08,737 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-10-14 19:31:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:31:08,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:31:08,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:31:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:31:08,845 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:31:08,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:31:08,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067903180] [2024-10-14 19:31:08,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067903180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:31:08,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:31:08,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:31:08,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616381818] [2024-10-14 19:31:08,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:31:08,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:31:08,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:31:08,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:31:08,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:31:08,847 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 48 [2024-10-14 19:31:08,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:31:08,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:31:08,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 48 [2024-10-14 19:31:08,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:31:08,933 INFO L124 PetriNetUnfolderBase]: 174/397 cut-off events. [2024-10-14 19:31:08,933 INFO L125 PetriNetUnfolderBase]: For 132/137 co-relation queries the response was YES. [2024-10-14 19:31:08,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 397 events. 174/397 cut-off events. For 132/137 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1872 event pairs, 166 based on Foata normal form. 8/354 useless extension candidates. Maximal degree in co-relation 830. Up to 291 conditions per place. [2024-10-14 19:31:08,939 INFO L140 encePairwiseOnDemand]: 46/48 looper letters, 16 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2024-10-14 19:31:08,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 45 transitions, 208 flow [2024-10-14 19:31:08,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:31:08,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:31:08,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2024-10-14 19:31:08,940 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6319444444444444 [2024-10-14 19:31:08,940 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 174 flow. Second operand 3 states and 91 transitions. [2024-10-14 19:31:08,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 45 transitions, 208 flow [2024-10-14 19:31:08,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 45 transitions, 152 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-10-14 19:31:08,942 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 116 flow [2024-10-14 19:31:08,942 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2024-10-14 19:31:08,942 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2024-10-14 19:31:08,942 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 116 flow [2024-10-14 19:31:08,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:31:08,943 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:31:08,943 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:31:08,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-14 19:31:09,148 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-10-14 19:31:09,149 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:31:09,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:31:09,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1274378883, now seen corresponding path program 1 times [2024-10-14 19:31:09,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:31:09,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152647815] [2024-10-14 19:31:09,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:31:09,150 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-10-14 19:31:09,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:31:09,153 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-10-14 19:31:09,153 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-10-14 19:31:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:31:09,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:31:09,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:31:09,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:31:09,332 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:31:09,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:31:09,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152647815] [2024-10-14 19:31:09,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152647815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:31:09,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:31:09,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:31:09,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212363565] [2024-10-14 19:31:09,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:31:09,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:31:09,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:31:09,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:31:09,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:31:09,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 48 [2024-10-14 19:31:09,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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-10-14 19:31:09,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:31:09,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 48 [2024-10-14 19:31:09,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:31:09,630 INFO L124 PetriNetUnfolderBase]: 432/899 cut-off events. [2024-10-14 19:31:09,630 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:31:09,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1698 conditions, 899 events. 432/899 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4953 event pairs, 125 based on Foata normal form. 8/853 useless extension candidates. Maximal degree in co-relation 1691. Up to 359 conditions per place. [2024-10-14 19:31:09,634 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 24 selfloop transitions, 1 changer transitions 22/71 dead transitions. [2024-10-14 19:31:09,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 71 transitions, 268 flow [2024-10-14 19:31:09,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:31:09,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:31:09,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2024-10-14 19:31:09,635 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-10-14 19:31:09,636 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 116 flow. Second operand 6 states and 180 transitions. [2024-10-14 19:31:09,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 71 transitions, 268 flow [2024-10-14 19:31:09,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 267 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:31:09,637 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 126 flow [2024-10-14 19:31:09,637 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=50, 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=6, PETRI_FLOW=126, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2024-10-14 19:31:09,638 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2024-10-14 19:31:09,638 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 126 flow [2024-10-14 19:31:09,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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-10-14 19:31:09,638 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:31:09,638 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:31:09,646 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-10-14 19:31:09,838 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-10-14 19:31:09,839 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:31:09,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:31:09,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1639762015, now seen corresponding path program 2 times [2024-10-14 19:31:09,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:31:09,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [613608996] [2024-10-14 19:31:09,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 19:31:09,840 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-10-14 19:31:09,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:31:09,843 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-10-14 19:31:09,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 19:31:09,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 19:31:09,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:31:09,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:31:09,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:31:09,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:31:09,969 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:31:09,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:31:09,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [613608996] [2024-10-14 19:31:09,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [613608996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:31:09,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:31:09,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:31:09,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317082369] [2024-10-14 19:31:09,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:31:09,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:31:09,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:31:09,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:31:09,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:31:09,982 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 48 [2024-10-14 19:31:09,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 126 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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-10-14 19:31:09,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:31:09,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 48 [2024-10-14 19:31:09,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:31:10,177 INFO L124 PetriNetUnfolderBase]: 534/1140 cut-off events. [2024-10-14 19:31:10,177 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-14 19:31:10,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2220 conditions, 1140 events. 534/1140 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6579 event pairs, 150 based on Foata normal form. 8/1087 useless extension candidates. Maximal degree in co-relation 2209. Up to 401 conditions per place. [2024-10-14 19:31:10,181 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 23 selfloop transitions, 1 changer transitions 23/71 dead transitions. [2024-10-14 19:31:10,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 282 flow [2024-10-14 19:31:10,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:31:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:31:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2024-10-14 19:31:10,182 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-10-14 19:31:10,182 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 126 flow. Second operand 6 states and 180 transitions. [2024-10-14 19:31:10,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 282 flow [2024-10-14 19:31:10,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 271 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-14 19:31:10,184 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 130 flow [2024-10-14 19:31:10,184 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=52, 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=6, PETRI_FLOW=130, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2024-10-14 19:31:10,185 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2024-10-14 19:31:10,185 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 130 flow [2024-10-14 19:31:10,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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-10-14 19:31:10,185 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:31:10,185 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:31:10,191 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-10-14 19:31:10,385 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-10-14 19:31:10,386 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-14 19:31:10,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:31:10,387 INFO L85 PathProgramCache]: Analyzing trace with hash 2144679129, now seen corresponding path program 3 times [2024-10-14 19:31:10,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:31:10,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755440482] [2024-10-14 19:31:10,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 19:31:10,387 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-10-14 19:31:10,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:31:10,388 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-10-14 19:31:10,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 19:31:10,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-14 19:31:10,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-14 19:31:10,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 19:31:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:31:10,541 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-14 19:31:10,541 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 19:31:10,542 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-10-14 19:31:10,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-14 19:31:10,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-14 19:31:10,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-14 19:31:10,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-14 19:31:10,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-14 19:31:10,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-14 19:31:10,551 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-10-14 19:31:10,744 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-10-14 19:31:10,745 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2024-10-14 19:31:10,804 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 19:31:10,804 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 19:31:10,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:31:10 BasicIcfg [2024-10-14 19:31:10,809 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 19:31:10,810 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 19:31:10,810 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 19:31:10,810 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 19:31:10,810 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:31:06" (3/4) ... [2024-10-14 19:31:10,812 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 19:31:10,813 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 19:31:10,814 INFO L158 Benchmark]: Toolchain (without parser) took 6068.12ms. Allocated memory was 81.8MB in the beginning and 155.2MB in the end (delta: 73.4MB). Free memory was 46.7MB in the beginning and 44.0MB in the end (delta: 2.7MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. [2024-10-14 19:31:10,814 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 81.8MB. Free memory is still 58.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:31:10,814 INFO L158 Benchmark]: CACSL2BoogieTranslator took 657.12ms. Allocated memory is still 81.8MB. Free memory was 46.7MB in the beginning and 50.3MB in the end (delta: -3.6MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2024-10-14 19:31:10,814 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.03ms. Allocated memory is still 81.8MB. Free memory was 50.0MB in the beginning and 47.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 19:31:10,815 INFO L158 Benchmark]: Boogie Preprocessor took 38.26ms. Allocated memory is still 81.8MB. Free memory was 47.4MB in the beginning and 44.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 19:31:10,815 INFO L158 Benchmark]: RCFGBuilder took 693.25ms. Allocated memory was 81.8MB in the beginning and 121.6MB in the end (delta: 39.8MB). Free memory was 44.2MB in the beginning and 92.4MB in the end (delta: -48.2MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2024-10-14 19:31:10,815 INFO L158 Benchmark]: TraceAbstraction took 4627.03ms. Allocated memory was 121.6MB in the beginning and 155.2MB in the end (delta: 33.6MB). Free memory was 92.4MB in the beginning and 44.0MB in the end (delta: 48.4MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2024-10-14 19:31:10,816 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 155.2MB. Free memory is still 44.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:31:10,818 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.21ms. Allocated memory is still 81.8MB. Free memory is still 58.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 657.12ms. Allocated memory is still 81.8MB. Free memory was 46.7MB in the beginning and 50.3MB in the end (delta: -3.6MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.03ms. Allocated memory is still 81.8MB. Free memory was 50.0MB in the beginning and 47.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.26ms. Allocated memory is still 81.8MB. Free memory was 47.4MB in the beginning and 44.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 693.25ms. Allocated memory was 81.8MB in the beginning and 121.6MB in the end (delta: 39.8MB). Free memory was 44.2MB in the beginning and 92.4MB in the end (delta: -48.2MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4627.03ms. Allocated memory was 121.6MB in the beginning and 155.2MB in the end (delta: 33.6MB). Free memory was 92.4MB in the beginning and 44.0MB in the end (delta: 48.4MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 155.2MB. Free memory is still 44.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L723] 0 int b = 0; [L724] 0 _Bool main$tmp_guard0; [L725] 0 _Bool main$tmp_guard1; [L727] 0 int x = 0; [L729] 0 int y = 0; [L731] 0 int z = 0; [L732] 0 _Bool z$flush_delayed; [L733] 0 int z$mem_tmp; [L734] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd1; [L736] 0 _Bool z$r_buff0_thd2; [L737] 0 _Bool z$r_buff0_thd3; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$read_delayed; [L743] 0 int *z$read_delayed_var; [L744] 0 int z$w_buff0; [L745] 0 _Bool z$w_buff0_used; [L746] 0 int z$w_buff1; [L747] 0 _Bool z$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L845] 0 pthread_t t852; [L846] FCALL, FORK 0 pthread_create(&t852, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852=-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] [L847] 0 pthread_t t853; [L848] FCALL, FORK 0 pthread_create(&t853, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852=-1, t853=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] [L849] 0 pthread_t t854; [L850] FCALL, FORK 0 pthread_create(&t854, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852=-1, t853=0, t854=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] [L802] 3 z$w_buff1 = z$w_buff0 [L803] 3 z$w_buff0 = 1 [L804] 3 z$w_buff1_used = z$w_buff0_used [L805] 3 z$w_buff0_used = (_Bool)1 [L806] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L806] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 3 z$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L814] 3 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L817] 3 __unbuffered_p2_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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 __unbuffered_p2_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L753] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L756] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L768] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L771] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L774] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 z$flush_delayed = weak$$choice2 [L780] 2 z$mem_tmp = z [L781] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L782] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L783] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L784] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L785] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L787] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 __unbuffered_p1_EBX = z [L789] 2 z = z$flush_delayed ? z$mem_tmp : z [L790] 2 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L824] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L825] 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 [L826] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L827] 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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t852=-1, t853=0, t854=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] 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) [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 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 [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t852=-1, t853=0, t854=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t852=-1, t853=0, t854=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L865] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix032.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 843]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 76 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: 4.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 235 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 219 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 720 IncrementalHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 4 mSDtfsCounter, 720 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=4, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 433 SizeOfPredicates, 11 NumberOfNonLiveVariables, 752 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-10-14 19:31:10,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample