./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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.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 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 19:00:18,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:00:18,197 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 19:00:18,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:00:18,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:00:18,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:00:18,236 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:00:18,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:00:18,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:00:18,238 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:00:18,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:00:18,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:00:18,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:00:18,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:00:18,240 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:00:18,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:00:18,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:00:18,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:00:18,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:00:18,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:00:18,244 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 19:00:18,244 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 19:00:18,245 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 19:00:18,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:00:18,248 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 19:00:18,248 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:00:18,248 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:00:18,249 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:00:18,249 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:00:18,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:00:18,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:00:18,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:00:18,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:00:18,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:00:18,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:00:18,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:00:18,251 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 19:00:18,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 19:00:18,252 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:00:18,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:00:18,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:00:18,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:00:18,253 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 -> 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 [2024-10-24 19:00:18,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:00:18,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:00:18,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:00:18,590 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:00:18,591 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:00:18,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-10-24 19:00:20,104 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:00:20,402 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:00:20,402 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-10-24 19:00:20,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c7d225fb/6a67807d84b446ac9154bad82bc6aab6/FLAGcbc9a934e [2024-10-24 19:00:20,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c7d225fb/6a67807d84b446ac9154bad82bc6aab6 [2024-10-24 19:00:20,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:00:20,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:00:20,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:00:20,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:00:20,461 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:00:20,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:00:20" (1/1) ... [2024-10-24 19:00:20,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@371195b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:20, skipping insertion in model container [2024-10-24 19:00:20,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:00:20" (1/1) ... [2024-10-24 19:00:20,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:00:20,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:00:20,974 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 19:00:21,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:00:21,110 INFO L204 MainTranslator]: Completed translation [2024-10-24 19:00:21,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:21 WrapperNode [2024-10-24 19:00:21,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:00:21,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 19:00:21,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 19:00:21,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 19:00:21,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:21" (1/1) ... [2024-10-24 19:00:21,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:21" (1/1) ... [2024-10-24 19:00:21,169 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 126 [2024-10-24 19:00:21,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 19:00:21,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 19:00:21,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 19:00:21,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 19:00:21,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:21" (1/1) ... [2024-10-24 19:00:21,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:21" (1/1) ... [2024-10-24 19:00:21,191 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:21" (1/1) ... [2024-10-24 19:00:21,213 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-24 19:00:21,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:21" (1/1) ... [2024-10-24 19:00:21,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:21" (1/1) ... [2024-10-24 19:00:21,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:21" (1/1) ... [2024-10-24 19:00:21,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:21" (1/1) ... [2024-10-24 19:00:21,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:21" (1/1) ... [2024-10-24 19:00:21,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:21" (1/1) ... [2024-10-24 19:00:21,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 19:00:21,239 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 19:00:21,239 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 19:00:21,239 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 19:00:21,240 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:21" (1/1) ... [2024-10-24 19:00:21,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:00:21,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:00:21,281 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-24 19:00:21,287 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-24 19:00:21,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-24 19:00:21,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 19:00:21,354 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-24 19:00:21,355 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-24 19:00:21,355 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-24 19:00:21,355 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-24 19:00:21,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 19:00:21,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-24 19:00:21,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 19:00:21,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 19:00:21,360 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 19:00:21,577 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 19:00:21,580 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 19:00:21,866 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 19:00:21,866 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 19:00:22,072 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 19:00:22,072 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 19:00:22,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:00:22 BoogieIcfgContainer [2024-10-24 19:00:22,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 19:00:22,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 19:00:22,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 19:00:22,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 19:00:22,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:00:20" (1/3) ... [2024-10-24 19:00:22,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cfa6eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:00:22, skipping insertion in model container [2024-10-24 19:00:22,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:21" (2/3) ... [2024-10-24 19:00:22,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cfa6eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:00:22, skipping insertion in model container [2024-10-24 19:00:22,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:00:22" (3/3) ... [2024-10-24 19:00:22,083 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-10-24 19:00:22,098 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 19:00:22,099 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-24 19:00:22,099 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 19:00:22,143 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 19:00:22,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 78 flow [2024-10-24 19:00:22,212 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-10-24 19:00:22,213 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:00:22,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 2/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-10-24 19:00:22,217 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 78 flow [2024-10-24 19:00:22,221 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 72 flow [2024-10-24 19:00:22,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 19:00:22,244 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;@50021ead, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 19:00:22,245 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-24 19:00:22,252 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 19:00:22,252 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-10-24 19:00:22,252 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:00:22,252 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:00:22,253 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 19:00:22,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-24 19:00:22,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:00:22,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1573353172, now seen corresponding path program 1 times [2024-10-24 19:00:22,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:00:22,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394610185] [2024-10-24 19:00:22,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:00:22,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:00:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:00:22,796 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-24 19:00:22,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:00:22,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394610185] [2024-10-24 19:00:22,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394610185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:00:22,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:00:22,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:00:22,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001827133] [2024-10-24 19:00:22,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:00:22,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:00:22,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:00:22,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:00:22,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:00:22,848 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-10-24 19:00:22,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-24 19:00:22,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:00:22,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-10-24 19:00:22,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:00:23,039 INFO L124 PetriNetUnfolderBase]: 146/337 cut-off events. [2024-10-24 19:00:23,039 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:00:23,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 337 events. 146/337 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1789 event pairs, 20 based on Foata normal form. 24/355 useless extension candidates. Maximal degree in co-relation 600. Up to 208 conditions per place. [2024-10-24 19:00:23,044 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 23 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2024-10-24 19:00:23,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 138 flow [2024-10-24 19:00:23,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:00:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:00:23,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-10-24 19:00:23,057 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2024-10-24 19:00:23,059 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 72 flow. Second operand 3 states and 74 transitions. [2024-10-24 19:00:23,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 138 flow [2024-10-24 19:00:23,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:00:23,063 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2024-10-24 19:00:23,065 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-10-24 19:00:23,070 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2024-10-24 19:00:23,070 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2024-10-24 19:00:23,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-24 19:00:23,071 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:00:23,071 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:00:23,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 19:00:23,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-24 19:00:23,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:00:23,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1269111514, now seen corresponding path program 1 times [2024-10-24 19:00:23,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:00:23,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317218945] [2024-10-24 19:00:23,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:00:23,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:00:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:00:23,190 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-24 19:00:23,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:00:23,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317218945] [2024-10-24 19:00:23,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317218945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:00:23,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:00:23,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:00:23,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822597537] [2024-10-24 19:00:23,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:00:23,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:00:23,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:00:23,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:00:23,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:00:23,197 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-10-24 19:00:23,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-24 19:00:23,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:00:23,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-10-24 19:00:23,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:00:23,307 INFO L124 PetriNetUnfolderBase]: 129/293 cut-off events. [2024-10-24 19:00:23,308 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-10-24 19:00:23,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 293 events. 129/293 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1581 event pairs, 129 based on Foata normal form. 12/293 useless extension candidates. Maximal degree in co-relation 551. Up to 232 conditions per place. [2024-10-24 19:00:23,312 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 14 selfloop transitions, 1 changer transitions 1/27 dead transitions. [2024-10-24 19:00:23,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 94 flow [2024-10-24 19:00:23,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:00:23,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:00:23,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-10-24 19:00:23,314 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-10-24 19:00:23,314 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 3 states and 56 transitions. [2024-10-24 19:00:23,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 94 flow [2024-10-24 19:00:23,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:00:23,316 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2024-10-24 19:00:23,316 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2024-10-24 19:00:23,317 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2024-10-24 19:00:23,317 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2024-10-24 19:00:23,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-24 19:00:23,318 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:00:23,318 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:00:23,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 19:00:23,319 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-24 19:00:23,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:00:23,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1269112886, now seen corresponding path program 1 times [2024-10-24 19:00:23,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:00:23,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836805521] [2024-10-24 19:00:23,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:00:23,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:00:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:00:23,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:00:23,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:00:23,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836805521] [2024-10-24 19:00:23,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836805521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:00:23,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:00:23,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:00:23,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512681954] [2024-10-24 19:00:23,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:00:23,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:00:23,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:00:23,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:00:23,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:00:23,994 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-10-24 19:00:23,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 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-24 19:00:23,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:00:23,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-10-24 19:00:23,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:00:24,333 INFO L124 PetriNetUnfolderBase]: 232/491 cut-off events. [2024-10-24 19:00:24,333 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:00:24,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 491 events. 232/491 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2687 event pairs, 87 based on Foata normal form. 0/474 useless extension candidates. Maximal degree in co-relation 912. Up to 265 conditions per place. [2024-10-24 19:00:24,339 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 20 selfloop transitions, 3 changer transitions 28/60 dead transitions. [2024-10-24 19:00:24,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 60 transitions, 230 flow [2024-10-24 19:00:24,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 19:00:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-24 19:00:24,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-10-24 19:00:24,344 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2024-10-24 19:00:24,345 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 8 states and 149 transitions. [2024-10-24 19:00:24,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 60 transitions, 230 flow [2024-10-24 19:00:24,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 60 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:00:24,348 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 90 flow [2024-10-24 19:00:24,349 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=90, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2024-10-24 19:00:24,350 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2024-10-24 19:00:24,350 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 90 flow [2024-10-24 19:00:24,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 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-24 19:00:24,351 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:00:24,351 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:00:24,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 19:00:24,352 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-24 19:00:24,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:00:24,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1399698970, now seen corresponding path program 1 times [2024-10-24 19:00:24,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:00:24,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846522358] [2024-10-24 19:00:24,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:00:24,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:00:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:00:25,527 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-24 19:00:25,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:00:25,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846522358] [2024-10-24 19:00:25,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846522358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:00:25,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:00:25,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 19:00:25,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732004246] [2024-10-24 19:00:25,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:00:25,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 19:00:25,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:00:25,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 19:00:25,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 19:00:25,555 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-10-24 19:00:25,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 90 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-24 19:00:25,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:00:25,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-10-24 19:00:25,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:00:26,032 INFO L124 PetriNetUnfolderBase]: 324/627 cut-off events. [2024-10-24 19:00:26,032 INFO L125 PetriNetUnfolderBase]: For 470/470 co-relation queries the response was YES. [2024-10-24 19:00:26,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 627 events. 324/627 cut-off events. For 470/470 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3067 event pairs, 30 based on Foata normal form. 27/652 useless extension candidates. Maximal degree in co-relation 1566. Up to 349 conditions per place. [2024-10-24 19:00:26,038 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 32 selfloop transitions, 7 changer transitions 37/83 dead transitions. [2024-10-24 19:00:26,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 414 flow [2024-10-24 19:00:26,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 19:00:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 19:00:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 189 transitions. [2024-10-24 19:00:26,041 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2024-10-24 19:00:26,041 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 90 flow. Second operand 11 states and 189 transitions. [2024-10-24 19:00:26,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 414 flow [2024-10-24 19:00:26,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 83 transitions, 395 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-10-24 19:00:26,046 INFO L231 Difference]: Finished difference. Result has 53 places, 30 transitions, 138 flow [2024-10-24 19:00:26,046 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=138, PETRI_PLACES=53, PETRI_TRANSITIONS=30} [2024-10-24 19:00:26,047 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2024-10-24 19:00:26,047 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 30 transitions, 138 flow [2024-10-24 19:00:26,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-24 19:00:26,047 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:00:26,048 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:00:26,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 19:00:26,048 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-24 19:00:26,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:00:26,049 INFO L85 PathProgramCache]: Analyzing trace with hash 8564440, now seen corresponding path program 2 times [2024-10-24 19:00:26,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:00:26,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416351796] [2024-10-24 19:00:26,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:00:26,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:00:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:00:26,705 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-24 19:00:26,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:00:26,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416351796] [2024-10-24 19:00:26,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416351796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:00:26,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:00:26,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 19:00:26,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546906798] [2024-10-24 19:00:26,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:00:26,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 19:00:26,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:00:26,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 19:00:26,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 19:00:26,729 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-10-24 19:00:26,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 30 transitions, 138 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-24 19:00:26,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:00:26,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-10-24 19:00:26,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:00:27,068 INFO L124 PetriNetUnfolderBase]: 300/588 cut-off events. [2024-10-24 19:00:27,068 INFO L125 PetriNetUnfolderBase]: For 1292/1292 co-relation queries the response was YES. [2024-10-24 19:00:27,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1951 conditions, 588 events. 300/588 cut-off events. For 1292/1292 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2819 event pairs, 36 based on Foata normal form. 23/609 useless extension candidates. Maximal degree in co-relation 1932. Up to 328 conditions per place. [2024-10-24 19:00:27,073 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 33 selfloop transitions, 8 changer transitions 27/75 dead transitions. [2024-10-24 19:00:27,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 488 flow [2024-10-24 19:00:27,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 19:00:27,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-24 19:00:27,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-10-24 19:00:27,077 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5015873015873016 [2024-10-24 19:00:27,077 INFO L175 Difference]: Start difference. First operand has 53 places, 30 transitions, 138 flow. Second operand 9 states and 158 transitions. [2024-10-24 19:00:27,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 488 flow [2024-10-24 19:00:27,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 75 transitions, 461 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-10-24 19:00:27,082 INFO L231 Difference]: Finished difference. Result has 54 places, 32 transitions, 179 flow [2024-10-24 19:00:27,082 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=179, PETRI_PLACES=54, PETRI_TRANSITIONS=32} [2024-10-24 19:00:27,083 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2024-10-24 19:00:27,083 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 32 transitions, 179 flow [2024-10-24 19:00:27,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-24 19:00:27,084 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:00:27,084 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:00:27,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 19:00:27,084 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-24 19:00:27,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:00:27,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1098785011, now seen corresponding path program 1 times [2024-10-24 19:00:27,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:00:27,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197882064] [2024-10-24 19:00:27,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:00:27,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:00:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:00:27,252 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-24 19:00:27,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:00:27,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197882064] [2024-10-24 19:00:27,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197882064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:00:27,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:00:27,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:00:27,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134589546] [2024-10-24 19:00:27,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:00:27,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:00:27,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:00:27,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:00:27,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:00:27,265 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-10-24 19:00:27,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 32 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:00:27,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:00:27,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-10-24 19:00:27,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:00:27,397 INFO L124 PetriNetUnfolderBase]: 210/436 cut-off events. [2024-10-24 19:00:27,398 INFO L125 PetriNetUnfolderBase]: For 1304/1304 co-relation queries the response was YES. [2024-10-24 19:00:27,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1492 conditions, 436 events. 210/436 cut-off events. For 1304/1304 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1932 event pairs, 27 based on Foata normal form. 27/455 useless extension candidates. Maximal degree in co-relation 1472. Up to 220 conditions per place. [2024-10-24 19:00:27,402 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 37 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2024-10-24 19:00:27,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 49 transitions, 360 flow [2024-10-24 19:00:27,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:00:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:00:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2024-10-24 19:00:27,403 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-10-24 19:00:27,403 INFO L175 Difference]: Start difference. First operand has 54 places, 32 transitions, 179 flow. Second operand 4 states and 80 transitions. [2024-10-24 19:00:27,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 49 transitions, 360 flow [2024-10-24 19:00:27,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 311 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-10-24 19:00:27,407 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 169 flow [2024-10-24 19:00:27,407 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2024-10-24 19:00:27,408 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2024-10-24 19:00:27,408 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 169 flow [2024-10-24 19:00:27,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:00:27,408 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:00:27,408 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-24 19:00:27,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 19:00:27,409 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-24 19:00:27,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:00:27,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1156504817, now seen corresponding path program 1 times [2024-10-24 19:00:27,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:00:27,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836851517] [2024-10-24 19:00:27,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:00:27,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:00:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:00:27,597 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-24 19:00:27,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:00:27,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836851517] [2024-10-24 19:00:27,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836851517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:00:27,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:00:27,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:00:27,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381208943] [2024-10-24 19:00:27,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:00:27,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:00:27,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:00:27,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:00:27,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:00:27,610 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-10-24 19:00:27,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-24 19:00:27,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:00:27,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-10-24 19:00:27,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:00:27,763 INFO L124 PetriNetUnfolderBase]: 126/274 cut-off events. [2024-10-24 19:00:27,764 INFO L125 PetriNetUnfolderBase]: For 498/498 co-relation queries the response was YES. [2024-10-24 19:00:27,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 274 events. 126/274 cut-off events. For 498/498 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1035 event pairs, 28 based on Foata normal form. 18/284 useless extension candidates. Maximal degree in co-relation 894. Up to 117 conditions per place. [2024-10-24 19:00:27,766 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 31 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2024-10-24 19:00:27,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 45 transitions, 290 flow [2024-10-24 19:00:27,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:00:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:00:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-10-24 19:00:27,767 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-10-24 19:00:27,768 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 169 flow. Second operand 5 states and 90 transitions. [2024-10-24 19:00:27,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 45 transitions, 290 flow [2024-10-24 19:00:27,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 226 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-10-24 19:00:27,770 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 142 flow [2024-10-24 19:00:27,770 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2024-10-24 19:00:27,771 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2024-10-24 19:00:27,771 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 142 flow [2024-10-24 19:00:27,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-24 19:00:27,772 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:00:27,772 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-24 19:00:27,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 19:00:27,772 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-24 19:00:27,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:00:27,773 INFO L85 PathProgramCache]: Analyzing trace with hash -838954024, now seen corresponding path program 1 times [2024-10-24 19:00:27,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:00:27,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486205853] [2024-10-24 19:00:27,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:00:27,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:00:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:00:28,015 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-24 19:00:28,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:00:28,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486205853] [2024-10-24 19:00:28,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486205853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:00:28,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:00:28,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 19:00:28,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538243958] [2024-10-24 19:00:28,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:00:28,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:00:28,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:00:28,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:00:28,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:00:28,022 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-10-24 19:00:28,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:00:28,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:00:28,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-10-24 19:00:28,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:00:28,225 INFO L124 PetriNetUnfolderBase]: 141/358 cut-off events. [2024-10-24 19:00:28,226 INFO L125 PetriNetUnfolderBase]: For 322/360 co-relation queries the response was YES. [2024-10-24 19:00:28,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 358 events. 141/358 cut-off events. For 322/360 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1735 event pairs, 35 based on Foata normal form. 10/341 useless extension candidates. Maximal degree in co-relation 922. Up to 142 conditions per place. [2024-10-24 19:00:28,227 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 21 selfloop transitions, 1 changer transitions 21/55 dead transitions. [2024-10-24 19:00:28,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 55 transitions, 294 flow [2024-10-24 19:00:28,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:00:28,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:00:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2024-10-24 19:00:28,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2024-10-24 19:00:28,229 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 142 flow. Second operand 6 states and 104 transitions. [2024-10-24 19:00:28,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 55 transitions, 294 flow [2024-10-24 19:00:28,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 285 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-24 19:00:28,231 INFO L231 Difference]: Finished difference. Result has 53 places, 31 transitions, 134 flow [2024-10-24 19:00:28,232 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=53, PETRI_TRANSITIONS=31} [2024-10-24 19:00:28,233 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2024-10-24 19:00:28,234 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 31 transitions, 134 flow [2024-10-24 19:00:28,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:00:28,234 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:00:28,235 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-24 19:00:28,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 19:00:28,235 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-24 19:00:28,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:00:28,239 INFO L85 PathProgramCache]: Analyzing trace with hash -73551806, now seen corresponding path program 2 times [2024-10-24 19:00:28,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:00:28,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030689680] [2024-10-24 19:00:28,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:00:28,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:00:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:00:29,189 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-24 19:00:29,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:00:29,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030689680] [2024-10-24 19:00:29,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030689680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:00:29,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:00:29,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 19:00:29,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893778722] [2024-10-24 19:00:29,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:00:29,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 19:00:29,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:00:29,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 19:00:29,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 19:00:29,201 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-10-24 19:00:29,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 31 transitions, 134 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:00:29,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:00:29,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-10-24 19:00:29,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:00:29,441 INFO L124 PetriNetUnfolderBase]: 89/253 cut-off events. [2024-10-24 19:00:29,442 INFO L125 PetriNetUnfolderBase]: For 150/170 co-relation queries the response was YES. [2024-10-24 19:00:29,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 253 events. 89/253 cut-off events. For 150/170 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1114 event pairs, 31 based on Foata normal form. 7/242 useless extension candidates. Maximal degree in co-relation 656. Up to 87 conditions per place. [2024-10-24 19:00:29,443 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 17 selfloop transitions, 4 changer transitions 11/45 dead transitions. [2024-10-24 19:00:29,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 242 flow [2024-10-24 19:00:29,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 19:00:29,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-24 19:00:29,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-10-24 19:00:29,445 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2024-10-24 19:00:29,445 INFO L175 Difference]: Start difference. First operand has 53 places, 31 transitions, 134 flow. Second operand 7 states and 115 transitions. [2024-10-24 19:00:29,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 242 flow [2024-10-24 19:00:29,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 229 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-24 19:00:29,447 INFO L231 Difference]: Finished difference. Result has 54 places, 31 transitions, 146 flow [2024-10-24 19:00:29,447 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=146, PETRI_PLACES=54, PETRI_TRANSITIONS=31} [2024-10-24 19:00:29,448 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2024-10-24 19:00:29,448 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 31 transitions, 146 flow [2024-10-24 19:00:29,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:00:29,449 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:00:29,449 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-24 19:00:29,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 19:00:29,449 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-24 19:00:29,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:00:29,450 INFO L85 PathProgramCache]: Analyzing trace with hash -2024233998, now seen corresponding path program 3 times [2024-10-24 19:00:29,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:00:29,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216837388] [2024-10-24 19:00:29,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:00:29,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:00:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:00:29,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 19:00:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:00:29,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 19:00:29,591 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 19:00:29,592 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-10-24 19:00:29,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-10-24 19:00:29,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-10-24 19:00:29,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-10-24 19:00:29,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-10-24 19:00:29,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-10-24 19:00:29,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 19:00:29,598 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2024-10-24 19:00:29,659 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 19:00:29,661 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 19:00:29,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:00:29 BasicIcfg [2024-10-24 19:00:29,667 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 19:00:29,667 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 19:00:29,667 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 19:00:29,667 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 19:00:29,668 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:00:22" (3/4) ... [2024-10-24 19:00:29,670 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 19:00:29,671 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 19:00:29,672 INFO L158 Benchmark]: Toolchain (without parser) took 9219.58ms. Allocated memory was 142.6MB in the beginning and 308.3MB in the end (delta: 165.7MB). Free memory was 88.8MB in the beginning and 123.9MB in the end (delta: -35.0MB). Peak memory consumption was 130.8MB. Max. memory is 16.1GB. [2024-10-24 19:00:29,672 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 90.2MB. Free memory is still 52.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:00:29,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 656.79ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 105.9MB in the end (delta: -17.5MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-10-24 19:00:29,673 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.56ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 102.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 19:00:29,673 INFO L158 Benchmark]: Boogie Preprocessor took 64.65ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 99.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 19:00:29,673 INFO L158 Benchmark]: RCFGBuilder took 833.66ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 69.3MB in the end (delta: 30.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-24 19:00:29,674 INFO L158 Benchmark]: TraceAbstraction took 7592.19ms. Allocated memory was 142.6MB in the beginning and 308.3MB in the end (delta: 165.7MB). Free memory was 68.7MB in the beginning and 124.9MB in the end (delta: -56.2MB). Peak memory consumption was 111.4MB. Max. memory is 16.1GB. [2024-10-24 19:00:29,674 INFO L158 Benchmark]: Witness Printer took 4.02ms. Allocated memory is still 308.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:00:29,676 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.27ms. Allocated memory is still 90.2MB. Free memory is still 52.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 656.79ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 105.9MB in the end (delta: -17.5MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.56ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 102.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.65ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 99.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 833.66ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 69.3MB in the end (delta: 30.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7592.19ms. Allocated memory was 142.6MB in the beginning and 308.3MB in the end (delta: 165.7MB). Free memory was 68.7MB in the beginning and 124.9MB in the end (delta: -56.2MB). Peak memory consumption was 111.4MB. Max. memory is 16.1GB. * Witness Printer took 4.02ms. Allocated memory is still 308.3MB. Free memory is still 123.9MB. 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447=-1, t1448=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L736] 1 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L739] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447=-1, t1448=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447=-1, t1448=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447=-1, t1448=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L823] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L17] 0 __assert_fail ("0", "mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=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: 790]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 795]: 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 5 procedures, 51 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 281 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 251 mSDsluCounter, 188 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 163 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 868 IncrementalHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 25 mSDtfsCounter, 868 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=5, InterpolantAutomatonStates: 56, 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, 4.2s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 984 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-24 19:00:29,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.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 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 19:00:32,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:00:32,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 19:00:32,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:00:32,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:00:32,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:00:32,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:00:32,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:00:32,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:00:32,261 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:00:32,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:00:32,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:00:32,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:00:32,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:00:32,264 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:00:32,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:00:32,265 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:00:32,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:00:32,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:00:32,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:00:32,268 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 19:00:32,270 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 19:00:32,270 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 19:00:32,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:00:32,271 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 19:00:32,271 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 19:00:32,271 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:00:32,271 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 19:00:32,272 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:00:32,272 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:00:32,272 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:00:32,273 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:00:32,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:00:32,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:00:32,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:00:32,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:00:32,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:00:32,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:00:32,274 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 19:00:32,275 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 19:00:32,275 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:00:32,276 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:00:32,276 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:00:32,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:00:32,277 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 19:00:32,277 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 -> 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 [2024-10-24 19:00:32,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:00:32,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:00:32,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:00:32,690 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:00:32,691 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:00:32,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-10-24 19:00:34,353 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:00:34,639 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:00:34,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-10-24 19:00:34,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c4fce3b8/a227d48cb76b4414b9c24969e4bb4582/FLAG88d009ed5 [2024-10-24 19:00:34,672 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c4fce3b8/a227d48cb76b4414b9c24969e4bb4582 [2024-10-24 19:00:34,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:00:34,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:00:34,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:00:34,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:00:34,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:00:34,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:00:34" (1/1) ... [2024-10-24 19:00:34,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bec8d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:34, skipping insertion in model container [2024-10-24 19:00:34,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:00:34" (1/1) ... [2024-10-24 19:00:34,737 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:00:35,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:00:35,210 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 19:00:35,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:00:35,358 INFO L204 MainTranslator]: Completed translation [2024-10-24 19:00:35,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:35 WrapperNode [2024-10-24 19:00:35,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:00:35,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 19:00:35,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 19:00:35,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 19:00:35,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:35" (1/1) ... [2024-10-24 19:00:35,394 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:35" (1/1) ... [2024-10-24 19:00:35,438 INFO L138 Inliner]: procedures = 175, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 127 [2024-10-24 19:00:35,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 19:00:35,442 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 19:00:35,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 19:00:35,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 19:00:35,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:35" (1/1) ... [2024-10-24 19:00:35,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:35" (1/1) ... [2024-10-24 19:00:35,462 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:35" (1/1) ... [2024-10-24 19:00:35,491 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-24 19:00:35,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:35" (1/1) ... [2024-10-24 19:00:35,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:35" (1/1) ... [2024-10-24 19:00:35,506 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:35" (1/1) ... [2024-10-24 19:00:35,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:35" (1/1) ... [2024-10-24 19:00:35,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:35" (1/1) ... [2024-10-24 19:00:35,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:35" (1/1) ... [2024-10-24 19:00:35,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 19:00:35,527 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 19:00:35,527 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 19:00:35,527 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 19:00:35,528 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:35" (1/1) ... [2024-10-24 19:00:35,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:00:35,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:00:35,577 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-24 19:00:35,584 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-24 19:00:35,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-24 19:00:35,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 19:00:35,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 19:00:35,633 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-24 19:00:35,633 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-24 19:00:35,633 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-24 19:00:35,634 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-24 19:00:35,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-24 19:00:35,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 19:00:35,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 19:00:35,638 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 19:00:35,830 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 19:00:35,832 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 19:00:36,181 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 19:00:36,181 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 19:00:36,441 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 19:00:36,441 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 19:00:36,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:00:36 BoogieIcfgContainer [2024-10-24 19:00:36,443 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 19:00:36,445 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 19:00:36,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 19:00:36,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 19:00:36,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:00:34" (1/3) ... [2024-10-24 19:00:36,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5ce00e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:00:36, skipping insertion in model container [2024-10-24 19:00:36,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:35" (2/3) ... [2024-10-24 19:00:36,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5ce00e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:00:36, skipping insertion in model container [2024-10-24 19:00:36,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:00:36" (3/3) ... [2024-10-24 19:00:36,455 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-10-24 19:00:36,475 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 19:00:36,476 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-24 19:00:36,476 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 19:00:36,530 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 19:00:36,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 78 flow [2024-10-24 19:00:36,599 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-10-24 19:00:36,599 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:00:36,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 2/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-10-24 19:00:36,605 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 78 flow [2024-10-24 19:00:36,609 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 72 flow [2024-10-24 19:00:36,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 19:00:36,629 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;@5dfee7dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 19:00:36,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-24 19:00:36,637 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 19:00:36,637 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-10-24 19:00:36,637 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:00:36,638 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:00:36,638 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 19:00:36,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-24 19:00:36,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:00:36,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1632520084, now seen corresponding path program 1 times [2024-10-24 19:00:36,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:00:36,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145674047] [2024-10-24 19:00:36,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:00:36,663 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-24 19:00:36,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:00:36,665 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-24 19:00:36,666 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-24 19:00:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:00:36,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 19:00:36,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:00:36,798 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-24 19:00:36,799 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:00:36,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:00:36,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145674047] [2024-10-24 19:00:36,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145674047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:00:36,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:00:36,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:00:36,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902084225] [2024-10-24 19:00:36,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:00:36,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:00:36,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:00:36,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:00:36,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:00:36,841 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-10-24 19:00:36,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-24 19:00:36,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:00:36,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-10-24 19:00:36,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:00:37,026 INFO L124 PetriNetUnfolderBase]: 146/337 cut-off events. [2024-10-24 19:00:37,029 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:00:37,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 337 events. 146/337 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1789 event pairs, 20 based on Foata normal form. 24/355 useless extension candidates. Maximal degree in co-relation 600. Up to 208 conditions per place. [2024-10-24 19:00:37,036 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 23 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2024-10-24 19:00:37,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 138 flow [2024-10-24 19:00:37,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:00:37,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:00:37,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-10-24 19:00:37,050 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2024-10-24 19:00:37,052 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 72 flow. Second operand 3 states and 74 transitions. [2024-10-24 19:00:37,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 138 flow [2024-10-24 19:00:37,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:00:37,058 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2024-10-24 19:00:37,060 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-10-24 19:00:37,067 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2024-10-24 19:00:37,067 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2024-10-24 19:00:37,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-24 19:00:37,068 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:00:37,068 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:00:37,071 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-24 19:00:37,270 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-24 19:00:37,271 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-24 19:00:37,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:00:37,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1341572772, now seen corresponding path program 1 times [2024-10-24 19:00:37,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:00:37,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742166128] [2024-10-24 19:00:37,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:00:37,273 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-24 19:00:37,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:00:37,275 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-24 19:00:37,277 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-24 19:00:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:00:37,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:00:37,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:00:37,448 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-24 19:00:37,449 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:00:37,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:00:37,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742166128] [2024-10-24 19:00:37,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [742166128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:00:37,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:00:37,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:00:37,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494686601] [2024-10-24 19:00:37,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:00:37,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:00:37,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:00:37,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:00:37,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:00:37,466 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-10-24 19:00:37,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:00:37,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:00:37,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-10-24 19:00:37,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:00:37,660 INFO L124 PetriNetUnfolderBase]: 199/429 cut-off events. [2024-10-24 19:00:37,660 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-10-24 19:00:37,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 429 events. 199/429 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2122 event pairs, 24 based on Foata normal form. 20/443 useless extension candidates. Maximal degree in co-relation 825. Up to 232 conditions per place. [2024-10-24 19:00:37,667 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 30 selfloop transitions, 4 changer transitions 1/44 dead transitions. [2024-10-24 19:00:37,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 172 flow [2024-10-24 19:00:37,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:00:37,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:00:37,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2024-10-24 19:00:37,669 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5785714285714286 [2024-10-24 19:00:37,669 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 4 states and 81 transitions. [2024-10-24 19:00:37,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 172 flow [2024-10-24 19:00:37,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:00:37,672 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 86 flow [2024-10-24 19:00:37,672 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-10-24 19:00:37,673 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2024-10-24 19:00:37,673 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 86 flow [2024-10-24 19:00:37,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:00:37,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:00:37,674 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-24 19:00:37,678 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-24 19:00:37,874 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-24 19:00:37,875 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-24 19:00:37,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:00:37,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1603348435, now seen corresponding path program 1 times [2024-10-24 19:00:37,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:00:37,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108909612] [2024-10-24 19:00:37,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:00:37,877 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-24 19:00:37,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:00:37,879 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-24 19:00:37,881 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-24 19:00:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:00:37,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 19:00:37,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:00:38,020 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-24 19:00:38,020 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:00:38,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:00:38,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108909612] [2024-10-24 19:00:38,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108909612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:00:38,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:00:38,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:00:38,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054408041] [2024-10-24 19:00:38,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:00:38,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:00:38,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:00:38,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:00:38,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:00:38,031 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-10-24 19:00:38,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-24 19:00:38,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:00:38,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-10-24 19:00:38,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:00:38,212 INFO L124 PetriNetUnfolderBase]: 92/206 cut-off events. [2024-10-24 19:00:38,212 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2024-10-24 19:00:38,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 206 events. 92/206 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 710 event pairs, 16 based on Foata normal form. 14/214 useless extension candidates. Maximal degree in co-relation 465. Up to 71 conditions per place. [2024-10-24 19:00:38,216 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 26 selfloop transitions, 6 changer transitions 1/42 dead transitions. [2024-10-24 19:00:38,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 181 flow [2024-10-24 19:00:38,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:00:38,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:00:38,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-10-24 19:00:38,218 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-10-24 19:00:38,218 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 86 flow. Second operand 5 states and 90 transitions. [2024-10-24 19:00:38,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 181 flow [2024-10-24 19:00:38,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 172 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-24 19:00:38,220 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 102 flow [2024-10-24 19:00:38,221 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2024-10-24 19:00:38,223 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2024-10-24 19:00:38,224 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 102 flow [2024-10-24 19:00:38,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-24 19:00:38,235 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:00:38,235 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-24 19:00:38,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 19:00:38,435 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-24 19:00:38,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-24 19:00:38,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:00:38,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1129753666, now seen corresponding path program 1 times [2024-10-24 19:00:38,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:00:38,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803644838] [2024-10-24 19:00:38,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:00:38,438 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-24 19:00:38,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:00:38,441 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-24 19:00:38,443 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-24 19:00:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:00:38,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 19:00:38,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:00:38,602 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-24 19:00:38,602 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:00:38,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:00:38,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803644838] [2024-10-24 19:00:38,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803644838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:00:38,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:00:38,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:00:38,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706121920] [2024-10-24 19:00:38,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:00:38,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:00:38,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:00:38,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:00:38,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:00:38,605 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-10-24 19:00:38,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:00:38,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:00:38,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-10-24 19:00:38,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:00:38,659 INFO L124 PetriNetUnfolderBase]: 53/140 cut-off events. [2024-10-24 19:00:38,659 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-10-24 19:00:38,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 140 events. 53/140 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 467 event pairs, 52 based on Foata normal form. 4/131 useless extension candidates. Maximal degree in co-relation 289. Up to 109 conditions per place. [2024-10-24 19:00:38,660 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 14 selfloop transitions, 1 changer transitions 1/29 dead transitions. [2024-10-24 19:00:38,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 132 flow [2024-10-24 19:00:38,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:00:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:00:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-10-24 19:00:38,662 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-10-24 19:00:38,662 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 102 flow. Second operand 3 states and 56 transitions. [2024-10-24 19:00:38,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 132 flow [2024-10-24 19:00:38,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 104 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-10-24 19:00:38,664 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 72 flow [2024-10-24 19:00:38,664 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2024-10-24 19:00:38,665 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2024-10-24 19:00:38,665 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 72 flow [2024-10-24 19:00:38,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:00:38,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:00:38,665 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-24 19:00:38,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 19:00:38,869 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-24 19:00:38,869 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-24 19:00:38,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:00:38,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1129752294, now seen corresponding path program 1 times [2024-10-24 19:00:38,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:00:38,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849431920] [2024-10-24 19:00:38,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:00:38,871 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-24 19:00:38,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:00:38,872 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-24 19:00:38,874 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-24 19:00:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:00:38,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 19:00:38,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:00:39,239 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-24 19:00:39,240 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:00:39,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:00:39,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849431920] [2024-10-24 19:00:39,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [849431920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:00:39,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:00:39,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 19:00:39,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736751569] [2024-10-24 19:00:39,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:00:39,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:00:39,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:00:39,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:00:39,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:00:39,252 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-10-24 19:00:39,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 72 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:00:39,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:00:39,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-10-24 19:00:39,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:00:39,461 INFO L124 PetriNetUnfolderBase]: 108/270 cut-off events. [2024-10-24 19:00:39,461 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:00:39,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 270 events. 108/270 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1076 event pairs, 30 based on Foata normal form. 4/267 useless extension candidates. Maximal degree in co-relation 515. Up to 118 conditions per place. [2024-10-24 19:00:39,463 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 19 selfloop transitions, 1 changer transitions 17/48 dead transitions. [2024-10-24 19:00:39,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 48 transitions, 188 flow [2024-10-24 19:00:39,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:00:39,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:00:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-10-24 19:00:39,468 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-10-24 19:00:39,469 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 72 flow. Second operand 6 states and 110 transitions. [2024-10-24 19:00:39,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 48 transitions, 188 flow [2024-10-24 19:00:39,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 187 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:00:39,471 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 82 flow [2024-10-24 19:00:39,472 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=82, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2024-10-24 19:00:39,472 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2024-10-24 19:00:39,473 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 82 flow [2024-10-24 19:00:39,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:00:39,474 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:00:39,474 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-24 19:00:39,479 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-24 19:00:39,675 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-24 19:00:39,675 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-24 19:00:39,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:00:39,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1736565952, now seen corresponding path program 2 times [2024-10-24 19:00:39,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:00:39,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200651076] [2024-10-24 19:00:39,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 19:00:39,677 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-24 19:00:39,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:00:39,680 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-24 19:00:39,682 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-24 19:00:39,760 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 19:00:39,761 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:00:39,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 19:00:39,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:00:40,116 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-24 19:00:40,117 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:00:40,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:00:40,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200651076] [2024-10-24 19:00:40,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200651076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:00:40,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:00:40,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 19:00:40,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828864782] [2024-10-24 19:00:40,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:00:40,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 19:00:40,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:00:40,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 19:00:40,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-24 19:00:40,129 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-10-24 19:00:40,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 82 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 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-24 19:00:40,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:00:40,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-10-24 19:00:40,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:00:40,339 INFO L124 PetriNetUnfolderBase]: 93/235 cut-off events. [2024-10-24 19:00:40,339 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-24 19:00:40,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 235 events. 93/235 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 886 event pairs, 29 based on Foata normal form. 4/228 useless extension candidates. Maximal degree in co-relation 475. Up to 80 conditions per place. [2024-10-24 19:00:40,340 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 16 selfloop transitions, 3 changer transitions 16/47 dead transitions. [2024-10-24 19:00:40,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 196 flow [2024-10-24 19:00:40,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 19:00:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-24 19:00:40,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-10-24 19:00:40,342 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2024-10-24 19:00:40,342 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 82 flow. Second operand 7 states and 127 transitions. [2024-10-24 19:00:40,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 196 flow [2024-10-24 19:00:40,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 185 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-24 19:00:40,344 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 92 flow [2024-10-24 19:00:40,344 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=92, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2024-10-24 19:00:40,345 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2024-10-24 19:00:40,345 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 92 flow [2024-10-24 19:00:40,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 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-24 19:00:40,345 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:00:40,345 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-24 19:00:40,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 19:00:40,548 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-24 19:00:40,549 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-24 19:00:40,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:00:40,549 INFO L85 PathProgramCache]: Analyzing trace with hash 855981662, now seen corresponding path program 3 times [2024-10-24 19:00:40,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:00:40,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560325493] [2024-10-24 19:00:40,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 19:00:40,550 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-24 19:00:40,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:00:40,552 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-24 19:00:40,553 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-24 19:00:40,633 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-24 19:00:40,634 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-24 19:00:40,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 19:00:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:00:40,766 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 19:00:40,766 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 19:00:40,767 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-10-24 19:00:40,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-10-24 19:00:40,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-10-24 19:00:40,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-10-24 19:00:40,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-10-24 19:00:40,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-10-24 19:00:40,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-24 19:00:40,974 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-24 19:00:40,975 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-10-24 19:00:41,039 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 19:00:41,039 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 19:00:41,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:00:41 BasicIcfg [2024-10-24 19:00:41,044 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 19:00:41,045 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 19:00:41,045 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 19:00:41,045 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 19:00:41,045 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:00:36" (3/4) ... [2024-10-24 19:00:41,047 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 19:00:41,047 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 19:00:41,048 INFO L158 Benchmark]: Toolchain (without parser) took 6371.74ms. Allocated memory was 52.4MB in the beginning and 119.5MB in the end (delta: 67.1MB). Free memory was 24.3MB in the beginning and 75.0MB in the end (delta: -50.7MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-10-24 19:00:41,048 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 41.9MB. Free memory was 17.4MB in the beginning and 17.3MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:00:41,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 682.19ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 24.0MB in the beginning and 40.7MB in the end (delta: -16.7MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-10-24 19:00:41,049 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.22ms. Allocated memory is still 67.1MB. Free memory was 40.7MB in the beginning and 38.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 19:00:41,050 INFO L158 Benchmark]: Boogie Preprocessor took 83.89ms. Allocated memory is still 67.1MB. Free memory was 38.1MB in the beginning and 34.8MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 19:00:41,050 INFO L158 Benchmark]: RCFGBuilder took 916.34ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 34.8MB in the beginning and 43.5MB in the end (delta: -8.7MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-10-24 19:00:41,050 INFO L158 Benchmark]: TraceAbstraction took 4598.84ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 43.1MB in the beginning and 75.0MB in the end (delta: -31.9MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2024-10-24 19:00:41,051 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 119.5MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:00:41,053 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.17ms. Allocated memory is still 41.9MB. Free memory was 17.4MB in the beginning and 17.3MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 682.19ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 24.0MB in the beginning and 40.7MB in the end (delta: -16.7MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.22ms. Allocated memory is still 67.1MB. Free memory was 40.7MB in the beginning and 38.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.89ms. Allocated memory is still 67.1MB. Free memory was 38.1MB in the beginning and 34.8MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 916.34ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 34.8MB in the beginning and 43.5MB in the end (delta: -8.7MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4598.84ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 43.1MB in the beginning and 75.0MB in the end (delta: -31.9MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 119.5MB. Free memory is still 75.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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447=-1, t1448=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L736] 1 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L739] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447=-1, t1448=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447=-1, t1448=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447=-1, t1448=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L823] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L17] 0 __assert_fail ("0", "mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=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: 790]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 795]: 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 5 procedures, 51 locations, 6 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.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 147 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 135 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 484 IncrementalHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 7 mSDtfsCounter, 484 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=3, InterpolantAutomatonStates: 28, 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.9s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 439 SizeOfPredicates, 8 NumberOfNonLiveVariables, 544 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-24 19:00:41,084 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