./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:32:56,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:32:56,284 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 21:32:56,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:32:56,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:32:56,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:32:56,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:32:56,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:32:56,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:32:56,321 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:32:56,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:32:56,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:32:56,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:32:56,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:32:56,324 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:32:56,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:32:56,328 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:32:56,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:32:56,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:32:56,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:32:56,329 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:32:56,329 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:32:56,329 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:32:56,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:32:56,330 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:32:56,330 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:32:56,330 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:32:56,330 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:32:56,331 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:32:56,331 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:32:56,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:32:56,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:32:56,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:32:56,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:32:56,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:32:56,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:32:56,335 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 21:32:56,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 21:32:56,335 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:32:56,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:32:56,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:32:56,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:32:56,337 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 -> 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 [2024-11-22 21:32:56,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:32:56,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:32:56,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:32:56,629 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:32:56,630 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:32:56,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-11-22 21:32:58,094 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:32:58,344 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:32:58,345 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-11-22 21:32:58,365 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b99c49a08/065ec403215c401bb47314ff830c0c91/FLAGe45b92fe4 [2024-11-22 21:32:58,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b99c49a08/065ec403215c401bb47314ff830c0c91 [2024-11-22 21:32:58,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:32:58,383 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:32:58,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:32:58,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:32:58,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:32:58,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:32:58" (1/1) ... [2024-11-22 21:32:58,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f64b65e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:58, skipping insertion in model container [2024-11-22 21:32:58,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:32:58" (1/1) ... [2024-11-22 21:32:58,431 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:32:58,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:32:58,878 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:32:58,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:32:58,998 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:32:58,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:58 WrapperNode [2024-11-22 21:32:58,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:32:59,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:32:59,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:32:59,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:32:59,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:58" (1/1) ... [2024-11-22 21:32:59,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:58" (1/1) ... [2024-11-22 21:32:59,080 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125 [2024-11-22 21:32:59,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:32:59,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:32:59,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:32:59,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:32:59,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:58" (1/1) ... [2024-11-22 21:32:59,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:58" (1/1) ... [2024-11-22 21:32:59,101 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:58" (1/1) ... [2024-11-22 21:32:59,125 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 21:32:59,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:58" (1/1) ... [2024-11-22 21:32:59,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:58" (1/1) ... [2024-11-22 21:32:59,138 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:58" (1/1) ... [2024-11-22 21:32:59,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:58" (1/1) ... [2024-11-22 21:32:59,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:58" (1/1) ... [2024-11-22 21:32:59,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:58" (1/1) ... [2024-11-22 21:32:59,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:32:59,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:32:59,158 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:32:59,158 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:32:59,159 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:58" (1/1) ... [2024-11-22 21:32:59,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:32:59,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:32:59,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 21:32:59,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 21:32:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 21:32:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:32:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-22 21:32:59,285 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-22 21:32:59,285 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-22 21:32:59,285 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-22 21:32:59,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 21:32:59,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 21:32:59,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:32:59,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:32:59,287 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:32:59,421 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:32:59,423 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:32:59,683 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:32:59,684 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:32:59,893 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:32:59,893 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 21:32:59,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:32:59 BoogieIcfgContainer [2024-11-22 21:32:59,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:32:59,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:32:59,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:32:59,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:32:59,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:32:58" (1/3) ... [2024-11-22 21:32:59,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ef53d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:32:59, skipping insertion in model container [2024-11-22 21:32:59,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:58" (2/3) ... [2024-11-22 21:32:59,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ef53d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:32:59, skipping insertion in model container [2024-11-22 21:32:59,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:32:59" (3/3) ... [2024-11-22 21:32:59,905 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-11-22 21:32:59,924 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:32:59,924 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-22 21:32:59,924 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:32:59,983 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:33:00,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 78 flow [2024-11-22 21:33:00,050 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-11-22 21:33:00,051 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:33:00,054 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 45 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-11-22 21:33:00,056 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 78 flow [2024-11-22 21:33:00,060 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 72 flow [2024-11-22 21:33:00,072 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:33:00,081 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;@69c0ae94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:33:00,082 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-22 21:33:00,088 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:33:00,088 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-22 21:33:00,088 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:33:00,089 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:33:00,089 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-22 21:33:00,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:33:00,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:33:00,098 INFO L85 PathProgramCache]: Analyzing trace with hash 10512786, now seen corresponding path program 1 times [2024-11-22 21:33:00,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:33:00,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437337404] [2024-11-22 21:33:00,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:33:00,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:33:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:33:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:33:00,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:33:00,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437337404] [2024-11-22 21:33:00,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437337404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:33:00,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:33:00,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:33:00,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053532476] [2024-11-22 21:33:00,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:33:00,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:33:00,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:33:00,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:33:00,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:33:00,629 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-11-22 21:33:00,631 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.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:33:00,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:33:00,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-11-22 21:33:00,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:33:00,832 INFO L124 PetriNetUnfolderBase]: 148/334 cut-off events. [2024-11-22 21:33:00,833 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-22 21:33:00,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 334 events. 148/334 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1649 event pairs, 52 based on Foata normal form. 24/354 useless extension candidates. Maximal degree in co-relation 603. Up to 220 conditions per place. [2024-11-22 21:33:00,840 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 25 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2024-11-22 21:33:00,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 149 flow [2024-11-22 21:33:00,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:33:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:33:00,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-11-22 21:33:00,854 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7238095238095238 [2024-11-22 21:33:00,855 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 72 flow. Second operand 3 states and 76 transitions. [2024-11-22 21:33:00,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 149 flow [2024-11-22 21:33:00,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:33:00,860 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2024-11-22 21:33:00,862 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-11-22 21:33:00,865 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2024-11-22 21:33:00,867 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2024-11-22 21:33:00,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:33:00,868 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:33:00,868 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:33:00,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 21:33:00,869 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:33:00,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:33:00,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1003970263, now seen corresponding path program 1 times [2024-11-22 21:33:00,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:33:00,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187330778] [2024-11-22 21:33:00,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:33:00,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:33:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:33:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:33:00,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:33:00,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187330778] [2024-11-22 21:33:00,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187330778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:33:00,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:33:00,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:33:00,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356143299] [2024-11-22 21:33:00,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:33:00,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:33:00,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:33:00,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:33:00,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:33:00,992 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-22 21:33:00,992 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-11-22 21:33:00,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:33:00,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-22 21:33:00,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:33:01,134 INFO L124 PetriNetUnfolderBase]: 131/303 cut-off events. [2024-11-22 21:33:01,135 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-22 21:33:01,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 303 events. 131/303 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1571 event pairs, 131 based on Foata normal form. 12/304 useless extension candidates. Maximal degree in co-relation 569. Up to 236 conditions per place. [2024-11-22 21:33:01,138 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 14 selfloop transitions, 1 changer transitions 1/27 dead transitions. [2024-11-22 21:33:01,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 94 flow [2024-11-22 21:33:01,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:33:01,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:33:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-11-22 21:33:01,140 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-22 21:33:01,140 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 3 states and 56 transitions. [2024-11-22 21:33:01,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 94 flow [2024-11-22 21:33:01,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:33:01,141 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2024-11-22 21:33:01,142 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-11-22 21:33:01,143 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2024-11-22 21:33:01,144 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2024-11-22 21:33:01,144 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-11-22 21:33:01,144 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:33:01,144 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:33:01,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 21:33:01,146 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:33:01,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:33:01,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1003968983, now seen corresponding path program 1 times [2024-11-22 21:33:01,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:33:01,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050413089] [2024-11-22 21:33:01,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:33:01,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:33:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:33:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:33:01,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:33:01,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050413089] [2024-11-22 21:33:01,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050413089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:33:01,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:33:01,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:33:01,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862591829] [2024-11-22 21:33:01,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:33:01,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:33:01,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:33:01,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:33:01,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:33:01,507 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-22 21:33:01,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:33:01,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:33:01,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-22 21:33:01,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:33:01,775 INFO L124 PetriNetUnfolderBase]: 296/630 cut-off events. [2024-11-22 21:33:01,775 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:33:01,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 630 events. 296/630 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3508 event pairs, 110 based on Foata normal form. 0/611 useless extension candidates. Maximal degree in co-relation 1159. Up to 322 conditions per place. [2024-11-22 21:33:01,782 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 22 selfloop transitions, 3 changer transitions 33/66 dead transitions. [2024-11-22 21:33:01,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 66 transitions, 256 flow [2024-11-22 21:33:01,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:33:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:33:01,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-11-22 21:33:01,787 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-11-22 21:33:01,789 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 8 states and 148 transitions. [2024-11-22 21:33:01,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 66 transitions, 256 flow [2024-11-22 21:33:01,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 255 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:33:01,792 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 90 flow [2024-11-22 21:33:01,792 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-11-22 21:33:01,794 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2024-11-22 21:33:01,794 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 90 flow [2024-11-22 21:33:01,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:33:01,794 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:33:01,795 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:33:01,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 21:33:01,795 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:33:01,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:33:01,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1493365624, now seen corresponding path program 1 times [2024-11-22 21:33:01,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:33:01,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163974834] [2024-11-22 21:33:01,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:33:01,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:33:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:33:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:33:02,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:33:02,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163974834] [2024-11-22 21:33:02,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163974834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:33:02,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:33:02,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:33:02,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453008988] [2024-11-22 21:33:02,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:33:02,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:33:02,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:33:02,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:33:02,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:33:02,437 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-11-22 21:33:02,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 90 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:33:02,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:33:02,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-11-22 21:33:02,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:33:02,785 INFO L124 PetriNetUnfolderBase]: 363/709 cut-off events. [2024-11-22 21:33:02,786 INFO L125 PetriNetUnfolderBase]: For 417/417 co-relation queries the response was YES. [2024-11-22 21:33:02,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1684 conditions, 709 events. 363/709 cut-off events. For 417/417 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3466 event pairs, 172 based on Foata normal form. 30/730 useless extension candidates. Maximal degree in co-relation 1672. Up to 448 conditions per place. [2024-11-22 21:33:02,792 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 27 selfloop transitions, 4 changer transitions 31/71 dead transitions. [2024-11-22 21:33:02,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 71 transitions, 320 flow [2024-11-22 21:33:02,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:33:02,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-22 21:33:02,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2024-11-22 21:33:02,794 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-11-22 21:33:02,795 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 90 flow. Second operand 10 states and 165 transitions. [2024-11-22 21:33:02,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 71 transitions, 320 flow [2024-11-22 21:33:02,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 71 transitions, 307 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-22 21:33:02,799 INFO L231 Difference]: Finished difference. Result has 52 places, 29 transitions, 122 flow [2024-11-22 21:33:02,799 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=122, PETRI_PLACES=52, PETRI_TRANSITIONS=29} [2024-11-22 21:33:02,800 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2024-11-22 21:33:02,800 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 29 transitions, 122 flow [2024-11-22 21:33:02,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:33:02,801 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:33:02,801 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:33:02,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 21:33:02,801 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:33:02,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:33:02,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1356320913, now seen corresponding path program 1 times [2024-11-22 21:33:02,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:33:02,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950783055] [2024-11-22 21:33:02,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:33:02,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:33:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:33:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:33:03,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:33:03,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950783055] [2024-11-22 21:33:03,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950783055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:33:03,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:33:03,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:33:03,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282605236] [2024-11-22 21:33:03,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:33:03,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:33:03,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:33:03,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:33:03,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:33:03,053 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-22 21:33:03,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 29 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:33:03,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:33:03,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-22 21:33:03,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:33:03,304 INFO L124 PetriNetUnfolderBase]: 337/718 cut-off events. [2024-11-22 21:33:03,305 INFO L125 PetriNetUnfolderBase]: For 1336/1340 co-relation queries the response was YES. [2024-11-22 21:33:03,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 718 events. 337/718 cut-off events. For 1336/1340 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4244 event pairs, 98 based on Foata normal form. 28/727 useless extension candidates. Maximal degree in co-relation 2046. Up to 264 conditions per place. [2024-11-22 21:33:03,310 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 28 selfloop transitions, 3 changer transitions 21/61 dead transitions. [2024-11-22 21:33:03,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 342 flow [2024-11-22 21:33:03,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:33:03,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:33:03,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-11-22 21:33:03,312 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979 [2024-11-22 21:33:03,312 INFO L175 Difference]: Start difference. First operand has 52 places, 29 transitions, 122 flow. Second operand 7 states and 129 transitions. [2024-11-22 21:33:03,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 342 flow [2024-11-22 21:33:03,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 309 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-11-22 21:33:03,322 INFO L231 Difference]: Finished difference. Result has 52 places, 29 transitions, 128 flow [2024-11-22 21:33:03,322 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=128, PETRI_PLACES=52, PETRI_TRANSITIONS=29} [2024-11-22 21:33:03,325 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2024-11-22 21:33:03,325 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 29 transitions, 128 flow [2024-11-22 21:33:03,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:33:03,326 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:33:03,326 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:33:03,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 21:33:03,326 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:33:03,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:33:03,327 INFO L85 PathProgramCache]: Analyzing trace with hash -2059488794, now seen corresponding path program 1 times [2024-11-22 21:33:03,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:33:03,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594693929] [2024-11-22 21:33:03,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:33:03,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:33:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:33:04,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:33:04,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:33:04,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594693929] [2024-11-22 21:33:04,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594693929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:33:04,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:33:04,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:33:04,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778205044] [2024-11-22 21:33:04,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:33:04,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:33:04,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:33:04,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:33:04,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:33:04,119 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-22 21:33:04,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 29 transitions, 128 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:33:04,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:33:04,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-22 21:33:04,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:33:04,382 INFO L124 PetriNetUnfolderBase]: 279/644 cut-off events. [2024-11-22 21:33:04,383 INFO L125 PetriNetUnfolderBase]: For 1352/1359 co-relation queries the response was YES. [2024-11-22 21:33:04,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1783 conditions, 644 events. 279/644 cut-off events. For 1352/1359 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3746 event pairs, 117 based on Foata normal form. 30/669 useless extension candidates. Maximal degree in co-relation 1763. Up to 389 conditions per place. [2024-11-22 21:33:04,388 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 25 selfloop transitions, 5 changer transitions 17/58 dead transitions. [2024-11-22 21:33:04,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 58 transitions, 338 flow [2024-11-22 21:33:04,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:33:04,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:33:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-11-22 21:33:04,390 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2024-11-22 21:33:04,390 INFO L175 Difference]: Start difference. First operand has 52 places, 29 transitions, 128 flow. Second operand 8 states and 145 transitions. [2024-11-22 21:33:04,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 58 transitions, 338 flow [2024-11-22 21:33:04,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 58 transitions, 315 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-11-22 21:33:04,396 INFO L231 Difference]: Finished difference. Result has 55 places, 31 transitions, 158 flow [2024-11-22 21:33:04,397 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=31} [2024-11-22 21:33:04,398 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2024-11-22 21:33:04,399 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 31 transitions, 158 flow [2024-11-22 21:33:04,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:33:04,399 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:33:04,400 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:33:04,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 21:33:04,400 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:33:04,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:33:04,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1309929288, now seen corresponding path program 1 times [2024-11-22 21:33:04,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:33:04,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798942587] [2024-11-22 21:33:04,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:33:04,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:33:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:33:05,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:33:05,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:33:05,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798942587] [2024-11-22 21:33:05,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798942587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:33:05,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:33:05,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 21:33:05,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540023264] [2024-11-22 21:33:05,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:33:05,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 21:33:05,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:33:05,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 21:33:05,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 21:33:05,218 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-11-22 21:33:05,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 31 transitions, 158 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:33:05,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:33:05,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-11-22 21:33:05,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:33:05,692 INFO L124 PetriNetUnfolderBase]: 365/768 cut-off events. [2024-11-22 21:33:05,693 INFO L125 PetriNetUnfolderBase]: For 1911/1911 co-relation queries the response was YES. [2024-11-22 21:33:05,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2464 conditions, 768 events. 365/768 cut-off events. For 1911/1911 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4355 event pairs, 69 based on Foata normal form. 27/793 useless extension candidates. Maximal degree in co-relation 2442. Up to 362 conditions per place. [2024-11-22 21:33:05,698 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 33 selfloop transitions, 14 changer transitions 27/81 dead transitions. [2024-11-22 21:33:05,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 81 transitions, 543 flow [2024-11-22 21:33:05,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:33:05,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-22 21:33:05,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-11-22 21:33:05,699 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-11-22 21:33:05,700 INFO L175 Difference]: Start difference. First operand has 55 places, 31 transitions, 158 flow. Second operand 10 states and 170 transitions. [2024-11-22 21:33:05,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 81 transitions, 543 flow [2024-11-22 21:33:05,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 81 transitions, 509 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-11-22 21:33:05,705 INFO L231 Difference]: Finished difference. Result has 61 places, 37 transitions, 233 flow [2024-11-22 21:33:05,706 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=233, PETRI_PLACES=61, PETRI_TRANSITIONS=37} [2024-11-22 21:33:05,706 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places. [2024-11-22 21:33:05,707 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 37 transitions, 233 flow [2024-11-22 21:33:05,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:33:05,707 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:33:05,707 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:33:05,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 21:33:05,708 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:33:05,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:33:05,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1806894223, now seen corresponding path program 1 times [2024-11-22 21:33:05,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:33:05,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915521274] [2024-11-22 21:33:05,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:33:05,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:33:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:33:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:33:05,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:33:05,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915521274] [2024-11-22 21:33:05,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915521274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:33:05,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:33:05,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:33:05,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548437803] [2024-11-22 21:33:05,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:33:05,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:33:05,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:33:05,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:33:05,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:33:05,875 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-22 21:33:05,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 37 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:33:05,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:33:05,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-22 21:33:05,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:33:06,070 INFO L124 PetriNetUnfolderBase]: 365/753 cut-off events. [2024-11-22 21:33:06,071 INFO L125 PetriNetUnfolderBase]: For 2392/2459 co-relation queries the response was YES. [2024-11-22 21:33:06,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2483 conditions, 753 events. 365/753 cut-off events. For 2392/2459 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3944 event pairs, 58 based on Foata normal form. 90/817 useless extension candidates. Maximal degree in co-relation 2458. Up to 384 conditions per place. [2024-11-22 21:33:06,076 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 36 selfloop transitions, 4 changer transitions 4/57 dead transitions. [2024-11-22 21:33:06,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 433 flow [2024-11-22 21:33:06,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:33:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:33:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2024-11-22 21:33:06,078 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-11-22 21:33:06,078 INFO L175 Difference]: Start difference. First operand has 61 places, 37 transitions, 233 flow. Second operand 4 states and 80 transitions. [2024-11-22 21:33:06,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 433 flow [2024-11-22 21:33:06,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 57 transitions, 420 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-11-22 21:33:06,084 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 246 flow [2024-11-22 21:33:06,084 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2024-11-22 21:33:06,085 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 19 predicate places. [2024-11-22 21:33:06,085 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 246 flow [2024-11-22 21:33:06,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:33:06,085 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:33:06,086 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:33:06,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 21:33:06,086 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:33:06,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:33:06,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1265980497, now seen corresponding path program 1 times [2024-11-22 21:33:06,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:33:06,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546133152] [2024-11-22 21:33:06,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:33:06,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:33:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:33:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:33:06,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:33:06,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546133152] [2024-11-22 21:33:06,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546133152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:33:06,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:33:06,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:33:06,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009325575] [2024-11-22 21:33:06,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:33:06,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:33:06,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:33:06,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:33:06,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:33:06,254 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-22 21:33:06,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 246 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-11-22 21:33:06,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:33:06,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-22 21:33:06,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:33:06,386 INFO L124 PetriNetUnfolderBase]: 173/365 cut-off events. [2024-11-22 21:33:06,387 INFO L125 PetriNetUnfolderBase]: For 840/860 co-relation queries the response was YES. [2024-11-22 21:33:06,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 365 events. 173/365 cut-off events. For 840/860 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1523 event pairs, 26 based on Foata normal form. 49/399 useless extension candidates. Maximal degree in co-relation 1209. Up to 152 conditions per place. [2024-11-22 21:33:06,389 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 29 selfloop transitions, 6 changer transitions 9/53 dead transitions. [2024-11-22 21:33:06,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 53 transitions, 394 flow [2024-11-22 21:33:06,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:33:06,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:33:06,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2024-11-22 21:33:06,390 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5085714285714286 [2024-11-22 21:33:06,391 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 246 flow. Second operand 5 states and 89 transitions. [2024-11-22 21:33:06,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 53 transitions, 394 flow [2024-11-22 21:33:06,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 320 flow, removed 32 selfloop flow, removed 9 redundant places. [2024-11-22 21:33:06,395 INFO L231 Difference]: Finished difference. Result has 54 places, 33 transitions, 171 flow [2024-11-22 21:33:06,395 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=54, PETRI_TRANSITIONS=33} [2024-11-22 21:33:06,396 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2024-11-22 21:33:06,396 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 33 transitions, 171 flow [2024-11-22 21:33:06,396 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-11-22 21:33:06,397 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:33:06,397 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-11-22 21:33:06,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 21:33:06,398 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:33:06,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:33:06,398 INFO L85 PathProgramCache]: Analyzing trace with hash -280801110, now seen corresponding path program 1 times [2024-11-22 21:33:06,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:33:06,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403471317] [2024-11-22 21:33:06,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:33:06,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:33:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:33:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:33:07,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:33:07,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403471317] [2024-11-22 21:33:07,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403471317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:33:07,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:33:07,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 21:33:07,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224585178] [2024-11-22 21:33:07,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:33:07,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 21:33:07,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:33:07,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 21:33:07,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-22 21:33:07,737 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-22 21:33:07,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 33 transitions, 171 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:33:07,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:33:07,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-22 21:33:07,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:33:07,954 INFO L124 PetriNetUnfolderBase]: 83/213 cut-off events. [2024-11-22 21:33:07,954 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2024-11-22 21:33:07,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 213 events. 83/213 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 755 event pairs, 41 based on Foata normal form. 4/208 useless extension candidates. Maximal degree in co-relation 590. Up to 91 conditions per place. [2024-11-22 21:33:07,955 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 18 selfloop transitions, 4 changer transitions 16/49 dead transitions. [2024-11-22 21:33:07,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 49 transitions, 290 flow [2024-11-22 21:33:07,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:33:07,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:33:07,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-11-22 21:33:07,957 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-11-22 21:33:07,957 INFO L175 Difference]: Start difference. First operand has 54 places, 33 transitions, 171 flow. Second operand 7 states and 119 transitions. [2024-11-22 21:33:07,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 49 transitions, 290 flow [2024-11-22 21:33:07,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 49 transitions, 230 flow, removed 11 selfloop flow, removed 13 redundant places. [2024-11-22 21:33:07,959 INFO L231 Difference]: Finished difference. Result has 48 places, 29 transitions, 111 flow [2024-11-22 21:33:07,959 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=111, PETRI_PLACES=48, PETRI_TRANSITIONS=29} [2024-11-22 21:33:07,960 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2024-11-22 21:33:07,960 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 29 transitions, 111 flow [2024-11-22 21:33:07,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:33:07,961 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:33:07,961 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-11-22 21:33:07,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 21:33:07,962 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:33:07,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:33:07,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1997730380, now seen corresponding path program 2 times [2024-11-22 21:33:07,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:33:07,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506769950] [2024-11-22 21:33:07,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:33:07,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:33:08,031 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:33:08,031 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 21:33:08,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:33:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:33:08,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 21:33:08,123 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:33:08,125 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-22 21:33:08,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-22 21:33:08,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-22 21:33:08,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-22 21:33:08,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-22 21:33:08,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-22 21:33:08,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 21:33:08,128 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:33:08,200 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 21:33:08,200 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 21:33:08,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:33:08 BasicIcfg [2024-11-22 21:33:08,207 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 21:33:08,208 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 21:33:08,209 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 21:33:08,209 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 21:33:08,209 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:32:59" (3/4) ... [2024-11-22 21:33:08,211 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 21:33:08,212 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 21:33:08,213 INFO L158 Benchmark]: Toolchain (without parser) took 9829.57ms. Allocated memory was 157.3MB in the beginning and 339.7MB in the end (delta: 182.5MB). Free memory was 101.5MB in the beginning and 118.6MB in the end (delta: -17.1MB). Peak memory consumption was 167.2MB. Max. memory is 16.1GB. [2024-11-22 21:33:08,213 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 157.3MB. Free memory was 118.4MB in the beginning and 118.2MB in the end (delta: 141.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:33:08,213 INFO L158 Benchmark]: CACSL2BoogieTranslator took 613.93ms. Allocated memory is still 157.3MB. Free memory was 101.2MB in the beginning and 76.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-22 21:33:08,213 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.25ms. Allocated memory is still 157.3MB. Free memory was 76.0MB in the beginning and 73.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:33:08,214 INFO L158 Benchmark]: Boogie Preprocessor took 75.65ms. Allocated memory is still 157.3MB. Free memory was 73.0MB in the beginning and 70.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 21:33:08,215 INFO L158 Benchmark]: RCFGBuilder took 737.06ms. Allocated memory was 157.3MB in the beginning and 234.9MB in the end (delta: 77.6MB). Free memory was 69.7MB in the beginning and 163.4MB in the end (delta: -93.6MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2024-11-22 21:33:08,215 INFO L158 Benchmark]: TraceAbstraction took 8310.61ms. Allocated memory was 234.9MB in the beginning and 339.7MB in the end (delta: 104.9MB). Free memory was 163.4MB in the beginning and 119.7MB in the end (delta: 43.7MB). Peak memory consumption was 148.6MB. Max. memory is 16.1GB. [2024-11-22 21:33:08,216 INFO L158 Benchmark]: Witness Printer took 3.62ms. Allocated memory is still 339.7MB. Free memory was 119.7MB in the beginning and 118.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:33:08,217 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.23ms. Allocated memory is still 157.3MB. Free memory was 118.4MB in the beginning and 118.2MB in the end (delta: 141.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 613.93ms. Allocated memory is still 157.3MB. Free memory was 101.2MB in the beginning and 76.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.25ms. Allocated memory is still 157.3MB. Free memory was 76.0MB in the beginning and 73.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.65ms. Allocated memory is still 157.3MB. Free memory was 73.0MB in the beginning and 70.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 737.06ms. Allocated memory was 157.3MB in the beginning and 234.9MB in the end (delta: 77.6MB). Free memory was 69.7MB in the beginning and 163.4MB in the end (delta: -93.6MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8310.61ms. Allocated memory was 234.9MB in the beginning and 339.7MB in the end (delta: 104.9MB). Free memory was 163.4MB in the beginning and 119.7MB in the end (delta: 43.7MB). Peak memory consumption was 148.6MB. Max. memory is 16.1GB. * Witness Printer took 3.62ms. Allocated memory is still 339.7MB. Free memory was 119.7MB in the beginning and 118.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2473; [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L792] 0 pthread_t t2474; [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L745] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L762] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L821] 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, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "safe029_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - 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: 788]: 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: 791]: 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: 8.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 320 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 297 mSDsluCounter, 159 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 127 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 887 IncrementalHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 32 mSDtfsCounter, 887 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=246occurred in iteration=8, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 1067 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 21:33:08,242 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 ../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:33:10,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:33:10,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 21:33:10,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:33:10,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:33:10,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:33:10,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:33:10,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:33:10,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:33:10,650 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:33:10,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:33:10,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:33:10,652 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:33:10,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:33:10,652 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:33:10,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:33:10,653 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:33:10,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:33:10,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:33:10,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:33:10,655 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:33:10,655 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:33:10,656 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:33:10,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:33:10,658 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:33:10,658 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 21:33:10,659 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:33:10,659 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 21:33:10,659 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:33:10,659 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:33:10,660 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:33:10,660 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:33:10,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:33:10,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:33:10,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:33:10,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:33:10,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:33:10,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:33:10,665 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 21:33:10,665 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 21:33:10,666 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:33:10,666 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:33:10,666 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:33:10,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:33:10,667 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 -> 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 [2024-11-22 21:33:11,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:33:11,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:33:11,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:33:11,045 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:33:11,046 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:33:11,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-11-22 21:33:12,619 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:33:12,863 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:33:12,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-11-22 21:33:12,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5429a8651/02d92ea5a71c4abc974bbe87075c12a7/FLAG7ca9a5028 [2024-11-22 21:33:13,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5429a8651/02d92ea5a71c4abc974bbe87075c12a7 [2024-11-22 21:33:13,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:33:13,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:33:13,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:33:13,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:33:13,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:33:13,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:33:13" (1/1) ... [2024-11-22 21:33:13,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59600ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:33:13, skipping insertion in model container [2024-11-22 21:33:13,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:33:13" (1/1) ... [2024-11-22 21:33:13,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:33:13,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:33:13,704 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:33:13,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:33:13,833 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:33:13,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:33:13 WrapperNode [2024-11-22 21:33:13,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:33:13,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:33:13,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:33:13,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:33:13,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:33:13" (1/1) ... [2024-11-22 21:33:13,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:33:13" (1/1) ... [2024-11-22 21:33:13,905 INFO L138 Inliner]: procedures = 175, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 126 [2024-11-22 21:33:13,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:33:13,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:33:13,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:33:13,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:33:13,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:33:13" (1/1) ... [2024-11-22 21:33:13,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:33:13" (1/1) ... [2024-11-22 21:33:13,920 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:33:13" (1/1) ... [2024-11-22 21:33:13,947 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 21:33:13,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:33:13" (1/1) ... [2024-11-22 21:33:13,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:33:13" (1/1) ... [2024-11-22 21:33:13,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:33:13" (1/1) ... [2024-11-22 21:33:13,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:33:13" (1/1) ... [2024-11-22 21:33:13,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:33:13" (1/1) ... [2024-11-22 21:33:13,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:33:13" (1/1) ... [2024-11-22 21:33:13,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:33:13,980 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:33:13,980 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:33:13,980 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:33:13,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:33:13" (1/1) ... [2024-11-22 21:33:13,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:33:13,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:33:14,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 21:33:14,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 21:33:14,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 21:33:14,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:33:14,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 21:33:14,063 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-22 21:33:14,063 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-22 21:33:14,063 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-22 21:33:14,063 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-22 21:33:14,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 21:33:14,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:33:14,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:33:14,065 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:33:14,205 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:33:14,207 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:33:14,499 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:33:14,500 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:33:14,697 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:33:14,698 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 21:33:14,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:33:14 BoogieIcfgContainer [2024-11-22 21:33:14,699 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:33:14,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:33:14,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:33:14,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:33:14,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:33:13" (1/3) ... [2024-11-22 21:33:14,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@696b8607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:33:14, skipping insertion in model container [2024-11-22 21:33:14,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:33:13" (2/3) ... [2024-11-22 21:33:14,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@696b8607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:33:14, skipping insertion in model container [2024-11-22 21:33:14,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:33:14" (3/3) ... [2024-11-22 21:33:14,709 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-11-22 21:33:14,727 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:33:14,728 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-22 21:33:14,728 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:33:14,788 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:33:14,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 78 flow [2024-11-22 21:33:14,844 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-11-22 21:33:14,845 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:33:14,849 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 45 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-11-22 21:33:14,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 78 flow [2024-11-22 21:33:14,853 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 72 flow [2024-11-22 21:33:14,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:33:14,870 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;@5116d1f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:33:14,870 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-22 21:33:14,874 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:33:14,875 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-22 21:33:14,875 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:33:14,875 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:33:14,876 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-22 21:33:14,879 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:33:14,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:33:14,886 INFO L85 PathProgramCache]: Analyzing trace with hash 10576276, now seen corresponding path program 1 times [2024-11-22 21:33:14,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:33:14,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379746976] [2024-11-22 21:33:14,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:33:14,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:33:14,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:33:14,904 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:33:14,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 21:33:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:33:14,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:33:14,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:33:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:33:15,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:33:15,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:33:15,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379746976] [2024-11-22 21:33:15,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379746976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:33:15,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:33:15,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:33:15,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052359302] [2024-11-22 21:33:15,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:33:15,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:33:15,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:33:15,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:33:15,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:33:15,079 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-11-22 21:33:15,081 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.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:33:15,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:33:15,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-11-22 21:33:15,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:33:15,259 INFO L124 PetriNetUnfolderBase]: 148/334 cut-off events. [2024-11-22 21:33:15,260 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-22 21:33:15,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 334 events. 148/334 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1642 event pairs, 52 based on Foata normal form. 24/354 useless extension candidates. Maximal degree in co-relation 603. Up to 220 conditions per place. [2024-11-22 21:33:15,265 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 25 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2024-11-22 21:33:15,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 149 flow [2024-11-22 21:33:15,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:33:15,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:33:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-11-22 21:33:15,277 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7238095238095238 [2024-11-22 21:33:15,279 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 72 flow. Second operand 3 states and 76 transitions. [2024-11-22 21:33:15,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 149 flow [2024-11-22 21:33:15,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:33:15,284 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2024-11-22 21:33:15,286 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-11-22 21:33:15,291 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2024-11-22 21:33:15,292 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2024-11-22 21:33:15,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:33:15,292 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:33:15,292 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:33:15,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-22 21:33:15,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:33:15,496 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:33:15,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:33:15,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1331505195, now seen corresponding path program 1 times [2024-11-22 21:33:15,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:33:15,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715126641] [2024-11-22 21:33:15,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:33:15,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:33:15,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:33:15,501 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:33:15,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 21:33:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:33:15,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:33:15,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:33:15,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:33:15,655 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:33:15,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:33:15,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715126641] [2024-11-22 21:33:15,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715126641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:33:15,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:33:15,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:33:15,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345276185] [2024-11-22 21:33:15,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:33:15,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:33:15,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:33:15,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:33:15,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:33:15,665 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-22 21:33:15,666 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-11-22 21:33:15,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:33:15,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-22 21:33:15,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:33:15,855 INFO L124 PetriNetUnfolderBase]: 201/437 cut-off events. [2024-11-22 21:33:15,856 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-22 21:33:15,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 437 events. 201/437 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2102 event pairs, 26 based on Foata normal form. 20/447 useless extension candidates. Maximal degree in co-relation 841. Up to 232 conditions per place. [2024-11-22 21:33:15,863 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 30 selfloop transitions, 4 changer transitions 1/44 dead transitions. [2024-11-22 21:33:15,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 172 flow [2024-11-22 21:33:15,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:33:15,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:33:15,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2024-11-22 21:33:15,866 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5785714285714286 [2024-11-22 21:33:15,867 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 4 states and 81 transitions. [2024-11-22 21:33:15,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 172 flow [2024-11-22 21:33:15,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:33:15,870 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 86 flow [2024-11-22 21:33:15,870 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-11-22 21:33:15,871 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2024-11-22 21:33:15,871 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 86 flow [2024-11-22 21:33:15,871 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-11-22 21:33:15,872 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:33:15,872 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:33:15,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 21:33:16,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:33:16,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:33:16,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:33:16,075 INFO L85 PathProgramCache]: Analyzing trace with hash 672003792, now seen corresponding path program 1 times [2024-11-22 21:33:16,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:33:16,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74891006] [2024-11-22 21:33:16,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:33:16,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:33:16,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:33:16,091 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:33:16,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 21:33:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:33:16,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 21:33:16,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:33:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:33:16,294 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:33:16,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:33:16,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74891006] [2024-11-22 21:33:16,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74891006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:33:16,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:33:16,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:33:16,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692014345] [2024-11-22 21:33:16,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:33:16,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:33:16,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:33:16,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:33:16,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:33:16,306 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-22 21:33:16,306 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.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-11-22 21:33:16,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:33:16,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-22 21:33:16,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:33:16,432 INFO L124 PetriNetUnfolderBase]: 94/214 cut-off events. [2024-11-22 21:33:16,433 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2024-11-22 21:33:16,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 214 events. 94/214 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 719 event pairs, 18 based on Foata normal form. 14/221 useless extension candidates. Maximal degree in co-relation 479. Up to 71 conditions per place. [2024-11-22 21:33:16,434 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 26 selfloop transitions, 6 changer transitions 1/42 dead transitions. [2024-11-22 21:33:16,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 181 flow [2024-11-22 21:33:16,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:33:16,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:33:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-11-22 21:33:16,436 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-11-22 21:33:16,436 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 86 flow. Second operand 5 states and 90 transitions. [2024-11-22 21:33:16,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 181 flow [2024-11-22 21:33:16,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 172 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-22 21:33:16,438 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 102 flow [2024-11-22 21:33:16,438 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-11-22 21:33:16,439 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2024-11-22 21:33:16,439 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 102 flow [2024-11-22 21:33:16,439 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-11-22 21:33:16,439 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:33:16,439 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-11-22 21:33:16,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-22 21:33:16,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:33:16,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:33:16,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:33:16,641 INFO L85 PathProgramCache]: Analyzing trace with hash 668322412, now seen corresponding path program 1 times [2024-11-22 21:33:16,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:33:16,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849141435] [2024-11-22 21:33:16,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:33:16,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:33:16,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:33:16,645 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:33:16,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 21:33:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:33:16,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 21:33:16,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:33:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:33:16,800 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:33:16,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:33:16,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1849141435] [2024-11-22 21:33:16,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1849141435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:33:16,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:33:16,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:33:16,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573418161] [2024-11-22 21:33:16,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:33:16,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:33:16,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:33:16,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:33:16,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:33:16,805 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-22 21:33:16,805 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-11-22 21:33:16,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:33:16,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-22 21:33:16,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:33:16,855 INFO L124 PetriNetUnfolderBase]: 55/150 cut-off events. [2024-11-22 21:33:16,856 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-22 21:33:16,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 150 events. 55/150 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 489 event pairs, 54 based on Foata normal form. 4/142 useless extension candidates. Maximal degree in co-relation 308. Up to 113 conditions per place. [2024-11-22 21:33:16,857 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 14 selfloop transitions, 1 changer transitions 1/29 dead transitions. [2024-11-22 21:33:16,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 132 flow [2024-11-22 21:33:16,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:33:16,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:33:16,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-11-22 21:33:16,860 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-22 21:33:16,861 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 102 flow. Second operand 3 states and 56 transitions. [2024-11-22 21:33:16,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 132 flow [2024-11-22 21:33:16,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 104 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-11-22 21:33:16,863 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 72 flow [2024-11-22 21:33:16,864 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-11-22 21:33:16,865 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2024-11-22 21:33:16,866 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 72 flow [2024-11-22 21:33:16,866 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-11-22 21:33:16,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:33:16,866 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-11-22 21:33:16,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 21:33:17,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:33:17,067 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:33:17,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:33:17,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1667243436, now seen corresponding path program 1 times [2024-11-22 21:33:17,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:33:17,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539782221] [2024-11-22 21:33:17,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:33:17,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:33:17,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:33:17,073 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:33:17,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 21:33:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:33:17,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 21:33:17,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:33:17,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:33:17,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:33:17,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:33:17,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539782221] [2024-11-22 21:33:17,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539782221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:33:17,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:33:17,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 21:33:17,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961060919] [2024-11-22 21:33:17,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:33:17,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 21:33:17,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:33:17,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 21:33:17,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-22 21:33:17,711 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-22 21:33:17,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 72 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-11-22 21:33:17,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:33:17,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-22 21:33:17,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:33:17,952 INFO L124 PetriNetUnfolderBase]: 89/228 cut-off events. [2024-11-22 21:33:17,953 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:33:17,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 228 events. 89/228 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 877 event pairs, 39 based on Foata normal form. 4/220 useless extension candidates. Maximal degree in co-relation 432. Up to 88 conditions per place. [2024-11-22 21:33:17,954 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 21 selfloop transitions, 5 changer transitions 9/47 dead transitions. [2024-11-22 21:33:17,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 182 flow [2024-11-22 21:33:17,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:33:17,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:33:17,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-11-22 21:33:17,956 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2024-11-22 21:33:17,956 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 72 flow. Second operand 7 states and 127 transitions. [2024-11-22 21:33:17,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 182 flow [2024-11-22 21:33:17,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 181 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:33:17,958 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 99 flow [2024-11-22 21:33:17,958 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=99, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2024-11-22 21:33:17,958 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2024-11-22 21:33:17,959 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 99 flow [2024-11-22 21:33:17,959 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-11-22 21:33:17,959 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:33:17,959 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-11-22 21:33:17,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-22 21:33:18,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:33:18,162 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:33:18,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:33:18,163 INFO L85 PathProgramCache]: Analyzing trace with hash 477567008, now seen corresponding path program 2 times [2024-11-22 21:33:18,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:33:18,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150306068] [2024-11-22 21:33:18,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:33:18,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:33:18,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:33:18,167 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:33:18,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 21:33:18,247 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:33:18,247 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:33:18,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:33:18,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:33:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:33:18,316 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:33:18,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:33:18,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150306068] [2024-11-22 21:33:18,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150306068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:33:18,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:33:18,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:33:18,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246630494] [2024-11-22 21:33:18,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:33:18,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:33:18,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:33:18,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:33:18,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:33:18,326 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-22 21:33:18,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:33:18,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:33:18,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-22 21:33:18,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:33:18,459 INFO L124 PetriNetUnfolderBase]: 158/382 cut-off events. [2024-11-22 21:33:18,460 INFO L125 PetriNetUnfolderBase]: For 60/62 co-relation queries the response was YES. [2024-11-22 21:33:18,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 382 events. 158/382 cut-off events. For 60/62 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1781 event pairs, 82 based on Foata normal form. 5/368 useless extension candidates. Maximal degree in co-relation 821. Up to 163 conditions per place. [2024-11-22 21:33:18,462 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 18 selfloop transitions, 2 changer transitions 15/46 dead transitions. [2024-11-22 21:33:18,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 208 flow [2024-11-22 21:33:18,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:33:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:33:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2024-11-22 21:33:18,463 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5371428571428571 [2024-11-22 21:33:18,463 INFO L175 Difference]: Start difference. First operand has 45 places, 30 transitions, 99 flow. Second operand 5 states and 94 transitions. [2024-11-22 21:33:18,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 208 flow [2024-11-22 21:33:18,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 197 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-22 21:33:18,466 INFO L231 Difference]: Finished difference. Result has 46 places, 28 transitions, 93 flow [2024-11-22 21:33:18,466 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=46, PETRI_TRANSITIONS=28} [2024-11-22 21:33:18,466 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2024-11-22 21:33:18,467 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 93 flow [2024-11-22 21:33:18,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:33:18,467 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:33:18,467 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-11-22 21:33:18,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-22 21:33:18,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:33:18,668 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:33:18,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:33:18,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1730753038, now seen corresponding path program 3 times [2024-11-22 21:33:18,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:33:18,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833746886] [2024-11-22 21:33:18,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:33:18,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:33:18,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:33:18,673 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:33:18,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-22 21:33:18,754 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 21:33:18,754 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 21:33:18,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:33:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:33:18,843 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-22 21:33:18,847 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:33:18,848 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-22 21:33:18,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-22 21:33:18,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-22 21:33:18,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-22 21:33:18,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-22 21:33:18,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-22 21:33:18,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-22 21:33:19,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:33:19,051 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-11-22 21:33:19,124 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 21:33:19,125 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 21:33:19,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:33:19 BasicIcfg [2024-11-22 21:33:19,130 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 21:33:19,131 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 21:33:19,131 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 21:33:19,131 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 21:33:19,131 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:33:14" (3/4) ... [2024-11-22 21:33:19,134 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 21:33:19,135 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 21:33:19,136 INFO L158 Benchmark]: Toolchain (without parser) took 5937.89ms. Allocated memory was 62.9MB in the beginning and 113.2MB in the end (delta: 50.3MB). Free memory was 31.6MB in the beginning and 85.1MB in the end (delta: -53.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:33:19,136 INFO L158 Benchmark]: CDTParser took 1.14ms. Allocated memory is still 48.2MB. Free memory was 28.9MB in the beginning and 28.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:33:19,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 636.36ms. Allocated memory is still 62.9MB. Free memory was 31.4MB in the beginning and 39.2MB in the end (delta: -7.8MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2024-11-22 21:33:19,137 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.71ms. Allocated memory is still 62.9MB. Free memory was 39.2MB in the beginning and 36.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:33:19,137 INFO L158 Benchmark]: Boogie Preprocessor took 72.93ms. Allocated memory is still 62.9MB. Free memory was 36.6MB in the beginning and 33.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 21:33:19,138 INFO L158 Benchmark]: RCFGBuilder took 719.43ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 33.4MB in the beginning and 27.3MB in the end (delta: 6.1MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-11-22 21:33:19,139 INFO L158 Benchmark]: TraceAbstraction took 4429.74ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 26.7MB in the beginning and 85.1MB in the end (delta: -58.4MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2024-11-22 21:33:19,139 INFO L158 Benchmark]: Witness Printer took 4.42ms. Allocated memory is still 113.2MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:33:19,141 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14ms. Allocated memory is still 48.2MB. Free memory was 28.9MB in the beginning and 28.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 636.36ms. Allocated memory is still 62.9MB. Free memory was 31.4MB in the beginning and 39.2MB in the end (delta: -7.8MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.71ms. Allocated memory is still 62.9MB. Free memory was 39.2MB in the beginning and 36.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.93ms. Allocated memory is still 62.9MB. Free memory was 36.6MB in the beginning and 33.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 719.43ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 33.4MB in the beginning and 27.3MB in the end (delta: 6.1MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4429.74ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 26.7MB in the beginning and 85.1MB in the end (delta: -58.4MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. * Witness Printer took 4.42ms. Allocated memory is still 113.2MB. Free memory is still 85.1MB. 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; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2473; [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L792] 0 pthread_t t2474; [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-1, t2474=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L745] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L762] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-1, t2474=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-1, t2474=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-1, t2474=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L821] 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, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "safe029_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - 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: 788]: 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: 791]: 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.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 132 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 124 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 441 IncrementalHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 3 mSDtfsCounter, 441 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=3, InterpolantAutomatonStates: 27, 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.8s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 434 SizeOfPredicates, 7 NumberOfNonLiveVariables, 540 ConjunctsInSsa, 35 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-11-22 21:33:19,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample