./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:41:04,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:41:04,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:41:04,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:41:04,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:41:04,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:41:04,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:41:04,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:41:04,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:41:04,524 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:41:04,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:41:04,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:41:04,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:41:04,527 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:41:04,527 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:41:04,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:41:04,530 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:41:04,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:41:04,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:41:04,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:41:04,531 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:41:04,535 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:41:04,535 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:41:04,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:41:04,536 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:41:04,536 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:41:04,536 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:41:04,536 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:41:04,536 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:41:04,537 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:41:04,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:41:04,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:41:04,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:41:04,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:41:04,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:41:04,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:41:04,539 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:41:04,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:41:04,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:41:04,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:41:04,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:41:04,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:41:04,541 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-clean/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-clean/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 -> 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 [2024-10-11 19:41:04,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:41:04,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:41:04,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:41:04,840 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:41:04,841 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:41:04,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2024-10-11 19:41:06,318 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:41:06,574 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:41:06,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2024-10-11 19:41:06,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cfe6cf4d4/62c0eb39ac7b4ea7bca20235435beb8c/FLAG8ca257c71 [2024-10-11 19:41:06,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cfe6cf4d4/62c0eb39ac7b4ea7bca20235435beb8c [2024-10-11 19:41:06,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:41:06,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:41:06,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:41:06,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:41:06,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:41:06,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:41:06" (1/1) ... [2024-10-11 19:41:06,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b91425b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:06, skipping insertion in model container [2024-10-11 19:41:06,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:41:06" (1/1) ... [2024-10-11 19:41:06,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:41:07,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:41:07,115 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:41:07,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:41:07,242 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:41:07,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:07 WrapperNode [2024-10-11 19:41:07,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:41:07,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:41:07,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:41:07,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:41:07,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:07" (1/1) ... [2024-10-11 19:41:07,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:07" (1/1) ... [2024-10-11 19:41:07,342 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125 [2024-10-11 19:41:07,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:41:07,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:41:07,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:41:07,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:41:07,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:07" (1/1) ... [2024-10-11 19:41:07,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:07" (1/1) ... [2024-10-11 19:41:07,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:07" (1/1) ... [2024-10-11 19:41:07,420 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 19:41:07,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:07" (1/1) ... [2024-10-11 19:41:07,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:07" (1/1) ... [2024-10-11 19:41:07,453 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:07" (1/1) ... [2024-10-11 19:41:07,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:07" (1/1) ... [2024-10-11 19:41:07,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:07" (1/1) ... [2024-10-11 19:41:07,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:07" (1/1) ... [2024-10-11 19:41:07,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:41:07,470 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:41:07,472 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:41:07,472 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:41:07,475 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:07" (1/1) ... [2024-10-11 19:41:07,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:41:07,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:41:07,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:41:07,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:41:07,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 19:41:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:41:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-11 19:41:07,566 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-11 19:41:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-11 19:41:07,567 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-11 19:41:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 19:41:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 19:41:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:41:07,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:41:07,569 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 19:41:07,696 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:41:07,699 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:41:07,999 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:41:07,999 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:41:08,193 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:41:08,193 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 19:41:08,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:41:08 BoogieIcfgContainer [2024-10-11 19:41:08,194 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:41:08,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:41:08,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:41:08,199 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:41:08,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:41:06" (1/3) ... [2024-10-11 19:41:08,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76517d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:41:08, skipping insertion in model container [2024-10-11 19:41:08,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:07" (2/3) ... [2024-10-11 19:41:08,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76517d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:41:08, skipping insertion in model container [2024-10-11 19:41:08,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:41:08" (3/3) ... [2024-10-11 19:41:08,201 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2024-10-11 19:41:08,214 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:41:08,215 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-11 19:41:08,215 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:41:08,256 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 19:41:08,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 78 flow [2024-10-11 19:41:08,321 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-10-11 19:41:08,322 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:41:08,327 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 48 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-10-11 19:41:08,328 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 78 flow [2024-10-11 19:41:08,333 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 72 flow [2024-10-11 19:41:08,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:41:08,353 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;@3d3e8156, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:41:08,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 19:41:08,360 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:41:08,363 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-10-11 19:41:08,363 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:41:08,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:41:08,364 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 19:41:08,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-11 19:41:08,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:41:08,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1454874301, now seen corresponding path program 1 times [2024-10-11 19:41:08,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:41:08,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282368416] [2024-10-11 19:41:08,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:41:08,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:41:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:41:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:41:08,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:41:08,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282368416] [2024-10-11 19:41:08,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282368416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:41:08,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:41:08,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:41:08,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091111901] [2024-10-11 19:41:08,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:41:08,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:41:08,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:41:08,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:41:08,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:41:08,947 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-10-11 19:41:08,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:08,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:41:08,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-10-11 19:41:08,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:41:09,199 INFO L124 PetriNetUnfolderBase]: 146/337 cut-off events. [2024-10-11 19:41:09,200 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:41:09,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 337 events. 146/337 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1786 event pairs, 20 based on Foata normal form. 24/354 useless extension candidates. Maximal degree in co-relation 600. Up to 208 conditions per place. [2024-10-11 19:41:09,207 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 23 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2024-10-11 19:41:09,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 138 flow [2024-10-11 19:41:09,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:41:09,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:41:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-10-11 19:41:09,221 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2024-10-11 19:41:09,222 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 72 flow. Second operand 3 states and 74 transitions. [2024-10-11 19:41:09,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 138 flow [2024-10-11 19:41:09,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:41:09,227 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2024-10-11 19:41:09,229 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-10-11 19:41:09,233 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2024-10-11 19:41:09,235 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2024-10-11 19:41:09,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:09,236 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:41:09,236 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:41:09,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 19:41:09,236 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-11 19:41:09,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:41:09,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1378803974, now seen corresponding path program 1 times [2024-10-11 19:41:09,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:41:09,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541594605] [2024-10-11 19:41:09,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:41:09,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:41:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:41:09,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:41:09,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:41:09,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541594605] [2024-10-11 19:41:09,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541594605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:41:09,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:41:09,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:41:09,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353058821] [2024-10-11 19:41:09,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:41:09,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:41:09,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:41:09,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:41:09,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:41:09,346 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-10-11 19:41:09,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:09,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:41:09,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-10-11 19:41:09,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:41:09,468 INFO L124 PetriNetUnfolderBase]: 129/293 cut-off events. [2024-10-11 19:41:09,469 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-10-11 19:41:09,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 293 events. 129/293 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1607 event pairs, 129 based on Foata normal form. 12/292 useless extension candidates. Maximal degree in co-relation 551. Up to 232 conditions per place. [2024-10-11 19:41:09,473 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 14 selfloop transitions, 1 changer transitions 1/27 dead transitions. [2024-10-11 19:41:09,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 94 flow [2024-10-11 19:41:09,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:41:09,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:41:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-10-11 19:41:09,475 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-10-11 19:41:09,475 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 3 states and 56 transitions. [2024-10-11 19:41:09,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 94 flow [2024-10-11 19:41:09,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:41:09,477 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2024-10-11 19:41:09,477 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2024-10-11 19:41:09,478 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2024-10-11 19:41:09,478 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2024-10-11 19:41:09,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:09,478 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:41:09,479 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:41:09,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 19:41:09,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-11 19:41:09,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:41:09,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1378805286, now seen corresponding path program 1 times [2024-10-11 19:41:09,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:41:09,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903598257] [2024-10-11 19:41:09,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:41:09,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:41:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:41:09,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:41:09,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:41:09,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903598257] [2024-10-11 19:41:09,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903598257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:41:09,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:41:09,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:41:09,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726963127] [2024-10-11 19:41:09,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:41:09,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:41:09,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:41:09,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:41:09,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:41:09,815 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-10-11 19:41:09,816 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-10-11 19:41:09,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:41:09,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-10-11 19:41:09,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:41:10,101 INFO L124 PetriNetUnfolderBase]: 294/615 cut-off events. [2024-10-11 19:41:10,102 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:41:10,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 615 events. 294/615 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3421 event pairs, 108 based on Foata normal form. 0/595 useless extension candidates. Maximal degree in co-relation 1138. Up to 322 conditions per place. [2024-10-11 19:41:10,110 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 22 selfloop transitions, 3 changer transitions 33/66 dead transitions. [2024-10-11 19:41:10,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 66 transitions, 256 flow [2024-10-11 19:41:10,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 19:41:10,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 19:41:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-10-11 19:41:10,115 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-10-11 19:41:10,115 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 8 states and 148 transitions. [2024-10-11 19:41:10,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 66 transitions, 256 flow [2024-10-11 19:41:10,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 255 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:41:10,118 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 90 flow [2024-10-11 19:41:10,119 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=90, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2024-10-11 19:41:10,120 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2024-10-11 19:41:10,120 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 90 flow [2024-10-11 19:41:10,121 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-10-11 19:41:10,121 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:41:10,121 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:41:10,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 19:41:10,122 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-11 19:41:10,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:41:10,122 INFO L85 PathProgramCache]: Analyzing trace with hash -2039044571, now seen corresponding path program 1 times [2024-10-11 19:41:10,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:41:10,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429656899] [2024-10-11 19:41:10,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:41:10,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:41:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:41:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:41:10,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:41:10,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429656899] [2024-10-11 19:41:10,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429656899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:41:10,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:41:10,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:41:10,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978679244] [2024-10-11 19:41:10,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:41:10,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 19:41:10,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:41:10,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 19:41:10,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 19:41:10,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-10-11 19:41:10,726 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-10-11 19:41:10,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:41:10,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-10-11 19:41:10,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:41:11,081 INFO L124 PetriNetUnfolderBase]: 367/723 cut-off events. [2024-10-11 19:41:11,082 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2024-10-11 19:41:11,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1744 conditions, 723 events. 367/723 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3525 event pairs, 74 based on Foata normal form. 30/750 useless extension candidates. Maximal degree in co-relation 1732. Up to 427 conditions per place. [2024-10-11 19:41:11,089 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 27 selfloop transitions, 4 changer transitions 31/71 dead transitions. [2024-10-11 19:41:11,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 71 transitions, 320 flow [2024-10-11 19:41:11,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:41:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 19:41:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2024-10-11 19:41:11,091 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-10-11 19:41:11,091 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 90 flow. Second operand 10 states and 165 transitions. [2024-10-11 19:41:11,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 71 transitions, 320 flow [2024-10-11 19:41:11,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 71 transitions, 307 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-10-11 19:41:11,098 INFO L231 Difference]: Finished difference. Result has 52 places, 29 transitions, 122 flow [2024-10-11 19:41:11,099 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-10-11 19:41:11,100 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2024-10-11 19:41:11,101 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 29 transitions, 122 flow [2024-10-11 19:41:11,101 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-10-11 19:41:11,101 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:41:11,101 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:41:11,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 19:41:11,102 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-11 19:41:11,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:41:11,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1104713282, now seen corresponding path program 1 times [2024-10-11 19:41:11,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:41:11,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472105992] [2024-10-11 19:41:11,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:41:11,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:41:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:41:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:41:11,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:41:11,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472105992] [2024-10-11 19:41:11,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472105992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:41:11,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:41:11,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:41:11,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613206089] [2024-10-11 19:41:11,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:41:11,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:41:11,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:41:11,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:41:11,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:41:11,292 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-10-11 19:41:11,292 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-10-11 19:41:11,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:41:11,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-10-11 19:41:11,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:41:11,590 INFO L124 PetriNetUnfolderBase]: 327/710 cut-off events. [2024-10-11 19:41:11,590 INFO L125 PetriNetUnfolderBase]: For 1273/1277 co-relation queries the response was YES. [2024-10-11 19:41:11,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2039 conditions, 710 events. 327/710 cut-off events. For 1273/1277 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4223 event pairs, 105 based on Foata normal form. 28/727 useless extension candidates. Maximal degree in co-relation 2020. Up to 269 conditions per place. [2024-10-11 19:41:11,595 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 26 selfloop transitions, 3 changer transitions 21/59 dead transitions. [2024-10-11 19:41:11,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 332 flow [2024-10-11 19:41:11,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 19:41:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 19:41:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-10-11 19:41:11,597 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2024-10-11 19:41:11,597 INFO L175 Difference]: Start difference. First operand has 52 places, 29 transitions, 122 flow. Second operand 7 states and 127 transitions. [2024-10-11 19:41:11,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 332 flow [2024-10-11 19:41:11,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 299 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-10-11 19:41:11,603 INFO L231 Difference]: Finished difference. Result has 52 places, 29 transitions, 128 flow [2024-10-11 19:41:11,604 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-10-11 19:41:11,604 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2024-10-11 19:41:11,605 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 29 transitions, 128 flow [2024-10-11 19:41:11,605 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-10-11 19:41:11,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:41:11,605 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:41:11,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 19:41:11,606 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-11 19:41:11,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:41:11,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2123788995, now seen corresponding path program 1 times [2024-10-11 19:41:11,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:41:11,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462580291] [2024-10-11 19:41:11,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:41:11,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:41:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:41:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:41:12,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:41:12,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462580291] [2024-10-11 19:41:12,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462580291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:41:12,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:41:12,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:41:12,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204173382] [2024-10-11 19:41:12,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:41:12,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 19:41:12,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:41:12,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 19:41:12,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 19:41:12,402 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-10-11 19:41:12,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 29 transitions, 128 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:12,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:41:12,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-10-11 19:41:12,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:41:12,952 INFO L124 PetriNetUnfolderBase]: 376/799 cut-off events. [2024-10-11 19:41:12,952 INFO L125 PetriNetUnfolderBase]: For 1667/1667 co-relation queries the response was YES. [2024-10-11 19:41:12,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2297 conditions, 799 events. 376/799 cut-off events. For 1667/1667 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4552 event pairs, 91 based on Foata normal form. 30/826 useless extension candidates. Maximal degree in co-relation 2277. Up to 437 conditions per place. [2024-10-11 19:41:12,958 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 35 selfloop transitions, 10 changer transitions 33/85 dead transitions. [2024-10-11 19:41:12,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 85 transitions, 569 flow [2024-10-11 19:41:12,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 19:41:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 19:41:12,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 189 transitions. [2024-10-11 19:41:12,961 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2024-10-11 19:41:12,961 INFO L175 Difference]: Start difference. First operand has 52 places, 29 transitions, 128 flow. Second operand 11 states and 189 transitions. [2024-10-11 19:41:12,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 85 transitions, 569 flow [2024-10-11 19:41:12,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 85 transitions, 521 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-10-11 19:41:12,968 INFO L231 Difference]: Finished difference. Result has 61 places, 35 transitions, 197 flow [2024-10-11 19:41:12,968 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=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=197, PETRI_PLACES=61, PETRI_TRANSITIONS=35} [2024-10-11 19:41:12,969 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places. [2024-10-11 19:41:12,969 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 35 transitions, 197 flow [2024-10-11 19:41:12,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:12,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:41:12,970 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:41:12,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 19:41:12,971 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-11 19:41:12,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:41:12,971 INFO L85 PathProgramCache]: Analyzing trace with hash 378543326, now seen corresponding path program 1 times [2024-10-11 19:41:12,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:41:12,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203861689] [2024-10-11 19:41:12,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:41:12,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:41:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:41:13,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:41:13,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:41:13,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203861689] [2024-10-11 19:41:13,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203861689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:41:13,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:41:13,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:41:13,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114536731] [2024-10-11 19:41:13,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:41:13,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:41:13,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:41:13,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:41:13,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:41:13,680 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-10-11 19:41:13,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 35 transitions, 197 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:13,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:41:13,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-10-11 19:41:13,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:41:14,179 INFO L124 PetriNetUnfolderBase]: 511/1014 cut-off events. [2024-10-11 19:41:14,179 INFO L125 PetriNetUnfolderBase]: For 3489/3512 co-relation queries the response was YES. [2024-10-11 19:41:14,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3576 conditions, 1014 events. 511/1014 cut-off events. For 3489/3512 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5490 event pairs, 140 based on Foata normal form. 41/1049 useless extension candidates. Maximal degree in co-relation 3551. Up to 685 conditions per place. [2024-10-11 19:41:14,187 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 42 selfloop transitions, 19 changer transitions 31/101 dead transitions. [2024-10-11 19:41:14,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 101 transitions, 685 flow [2024-10-11 19:41:14,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 19:41:14,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 19:41:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 198 transitions. [2024-10-11 19:41:14,189 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-10-11 19:41:14,189 INFO L175 Difference]: Start difference. First operand has 61 places, 35 transitions, 197 flow. Second operand 12 states and 198 transitions. [2024-10-11 19:41:14,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 101 transitions, 685 flow [2024-10-11 19:41:14,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 101 transitions, 650 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-10-11 19:41:14,203 INFO L231 Difference]: Finished difference. Result has 69 places, 48 transitions, 358 flow [2024-10-11 19:41:14,203 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=358, PETRI_PLACES=69, PETRI_TRANSITIONS=48} [2024-10-11 19:41:14,205 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 31 predicate places. [2024-10-11 19:41:14,205 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 48 transitions, 358 flow [2024-10-11 19:41:14,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:14,206 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:41:14,206 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:41:14,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 19:41:14,206 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-11 19:41:14,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:41:14,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1376051314, now seen corresponding path program 2 times [2024-10-11 19:41:14,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:41:14,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705554727] [2024-10-11 19:41:14,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:41:14,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:41:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:41:14,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:41:14,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:41:14,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705554727] [2024-10-11 19:41:14,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705554727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:41:14,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:41:14,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:41:14,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309157269] [2024-10-11 19:41:14,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:41:14,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:41:14,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:41:14,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:41:14,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:41:14,984 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-10-11 19:41:14,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 48 transitions, 358 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:14,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:41:14,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-10-11 19:41:14,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:41:15,691 INFO L124 PetriNetUnfolderBase]: 527/1036 cut-off events. [2024-10-11 19:41:15,691 INFO L125 PetriNetUnfolderBase]: For 4531/4531 co-relation queries the response was YES. [2024-10-11 19:41:15,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4415 conditions, 1036 events. 527/1036 cut-off events. For 4531/4531 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5509 event pairs, 165 based on Foata normal form. 23/1057 useless extension candidates. Maximal degree in co-relation 4385. Up to 693 conditions per place. [2024-10-11 19:41:15,702 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 59 selfloop transitions, 23 changer transitions 33/120 dead transitions. [2024-10-11 19:41:15,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 120 transitions, 1089 flow [2024-10-11 19:41:15,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 19:41:15,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-10-11 19:41:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 209 transitions. [2024-10-11 19:41:15,705 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42653061224489797 [2024-10-11 19:41:15,705 INFO L175 Difference]: Start difference. First operand has 69 places, 48 transitions, 358 flow. Second operand 14 states and 209 transitions. [2024-10-11 19:41:15,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 120 transitions, 1089 flow [2024-10-11 19:41:15,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 120 transitions, 1055 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-10-11 19:41:15,762 INFO L231 Difference]: Finished difference. Result has 86 places, 60 transitions, 559 flow [2024-10-11 19:41:15,762 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=559, PETRI_PLACES=86, PETRI_TRANSITIONS=60} [2024-10-11 19:41:15,763 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 48 predicate places. [2024-10-11 19:41:15,763 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 60 transitions, 559 flow [2024-10-11 19:41:15,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:15,764 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:41:15,764 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:41:15,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 19:41:15,765 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-11 19:41:15,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:41:15,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1080796422, now seen corresponding path program 3 times [2024-10-11 19:41:15,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:41:15,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461964353] [2024-10-11 19:41:15,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:41:15,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:41:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:41:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:41:16,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:41:16,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461964353] [2024-10-11 19:41:16,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461964353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:41:16,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:41:16,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:41:16,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099351961] [2024-10-11 19:41:16,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:41:16,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:41:16,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:41:16,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:41:16,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:41:16,447 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-10-11 19:41:16,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 60 transitions, 559 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-10-11 19:41:16,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:41:16,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-10-11 19:41:16,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:41:16,933 INFO L124 PetriNetUnfolderBase]: 482/975 cut-off events. [2024-10-11 19:41:16,933 INFO L125 PetriNetUnfolderBase]: For 8007/8027 co-relation queries the response was YES. [2024-10-11 19:41:16,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4687 conditions, 975 events. 482/975 cut-off events. For 8007/8027 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5222 event pairs, 175 based on Foata normal form. 59/1029 useless extension candidates. Maximal degree in co-relation 4647. Up to 598 conditions per place. [2024-10-11 19:41:16,942 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 53 selfloop transitions, 25 changer transitions 28/114 dead transitions. [2024-10-11 19:41:16,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 114 transitions, 1229 flow [2024-10-11 19:41:16,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 19:41:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 19:41:16,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 173 transitions. [2024-10-11 19:41:16,943 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44935064935064933 [2024-10-11 19:41:16,944 INFO L175 Difference]: Start difference. First operand has 86 places, 60 transitions, 559 flow. Second operand 11 states and 173 transitions. [2024-10-11 19:41:16,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 114 transitions, 1229 flow [2024-10-11 19:41:16,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 114 transitions, 1122 flow, removed 46 selfloop flow, removed 9 redundant places. [2024-10-11 19:41:16,962 INFO L231 Difference]: Finished difference. Result has 86 places, 63 transitions, 641 flow [2024-10-11 19:41:16,962 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=641, PETRI_PLACES=86, PETRI_TRANSITIONS=63} [2024-10-11 19:41:16,963 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 48 predicate places. [2024-10-11 19:41:16,963 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 63 transitions, 641 flow [2024-10-11 19:41:16,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-10-11 19:41:16,964 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:41:16,964 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:41:16,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 19:41:16,964 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-11 19:41:16,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:41:16,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1337976194, now seen corresponding path program 1 times [2024-10-11 19:41:16,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:41:16,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129574947] [2024-10-11 19:41:16,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:41:16,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:41:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:41:17,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:41:17,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:41:17,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129574947] [2024-10-11 19:41:17,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129574947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:41:17,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:41:17,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:41:17,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040512364] [2024-10-11 19:41:17,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:41:17,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:41:17,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:41:17,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:41:17,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:41:17,627 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-10-11 19:41:17,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 63 transitions, 641 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:17,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:41:17,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-10-11 19:41:17,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:41:18,077 INFO L124 PetriNetUnfolderBase]: 298/747 cut-off events. [2024-10-11 19:41:18,077 INFO L125 PetriNetUnfolderBase]: For 6128/6139 co-relation queries the response was YES. [2024-10-11 19:41:18,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3794 conditions, 747 events. 298/747 cut-off events. For 6128/6139 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4742 event pairs, 65 based on Foata normal form. 20/754 useless extension candidates. Maximal degree in co-relation 3754. Up to 323 conditions per place. [2024-10-11 19:41:18,085 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 43 selfloop transitions, 12 changer transitions 25/96 dead transitions. [2024-10-11 19:41:18,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 96 transitions, 1116 flow [2024-10-11 19:41:18,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 19:41:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 19:41:18,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-10-11 19:41:18,087 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2024-10-11 19:41:18,087 INFO L175 Difference]: Start difference. First operand has 86 places, 63 transitions, 641 flow. Second operand 9 states and 156 transitions. [2024-10-11 19:41:18,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 96 transitions, 1116 flow [2024-10-11 19:41:18,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 96 transitions, 1063 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-10-11 19:41:18,104 INFO L231 Difference]: Finished difference. Result has 92 places, 62 transitions, 662 flow [2024-10-11 19:41:18,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=662, PETRI_PLACES=92, PETRI_TRANSITIONS=62} [2024-10-11 19:41:18,104 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 54 predicate places. [2024-10-11 19:41:18,105 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 62 transitions, 662 flow [2024-10-11 19:41:18,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:18,105 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:41:18,105 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:41:18,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 19:41:18,105 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-11 19:41:18,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:41:18,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1243412282, now seen corresponding path program 2 times [2024-10-11 19:41:18,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:41:18,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897918759] [2024-10-11 19:41:18,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:41:18,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:41:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:41:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:41:18,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:41:18,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897918759] [2024-10-11 19:41:18,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897918759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:41:18,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:41:18,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:41:18,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405591192] [2024-10-11 19:41:18,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:41:18,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:41:18,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:41:18,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:41:18,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:41:18,268 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-10-11 19:41:18,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 62 transitions, 662 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:18,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:41:18,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-10-11 19:41:18,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:41:18,450 INFO L124 PetriNetUnfolderBase]: 320/713 cut-off events. [2024-10-11 19:41:18,450 INFO L125 PetriNetUnfolderBase]: For 5419/5435 co-relation queries the response was YES. [2024-10-11 19:41:18,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3252 conditions, 713 events. 320/713 cut-off events. For 5419/5435 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3740 event pairs, 66 based on Foata normal form. 54/753 useless extension candidates. Maximal degree in co-relation 3215. Up to 394 conditions per place. [2024-10-11 19:41:18,459 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 40 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2024-10-11 19:41:18,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 58 transitions, 639 flow [2024-10-11 19:41:18,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:41:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:41:18,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2024-10-11 19:41:18,461 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5642857142857143 [2024-10-11 19:41:18,461 INFO L175 Difference]: Start difference. First operand has 92 places, 62 transitions, 662 flow. Second operand 4 states and 79 transitions. [2024-10-11 19:41:18,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 58 transitions, 639 flow [2024-10-11 19:41:18,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 58 transitions, 546 flow, removed 29 selfloop flow, removed 16 redundant places. [2024-10-11 19:41:18,472 INFO L231 Difference]: Finished difference. Result has 74 places, 47 transitions, 414 flow [2024-10-11 19:41:18,475 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=414, PETRI_PLACES=74, PETRI_TRANSITIONS=47} [2024-10-11 19:41:18,475 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 36 predicate places. [2024-10-11 19:41:18,475 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 47 transitions, 414 flow [2024-10-11 19:41:18,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:18,476 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:41:18,476 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:41:18,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 19:41:18,476 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-11 19:41:18,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:41:18,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1384636177, now seen corresponding path program 1 times [2024-10-11 19:41:18,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:41:18,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307164097] [2024-10-11 19:41:18,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:41:18,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:41:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:41:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:41:19,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:41:19,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307164097] [2024-10-11 19:41:19,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307164097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:41:19,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:41:19,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:41:19,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030583364] [2024-10-11 19:41:19,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:41:19,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:41:19,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:41:19,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:41:19,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:41:19,336 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-10-11 19:41:19,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 47 transitions, 414 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:19,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:41:19,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-10-11 19:41:19,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:41:19,707 INFO L124 PetriNetUnfolderBase]: 232/597 cut-off events. [2024-10-11 19:41:19,707 INFO L125 PetriNetUnfolderBase]: For 2758/2774 co-relation queries the response was YES. [2024-10-11 19:41:19,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2525 conditions, 597 events. 232/597 cut-off events. For 2758/2774 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3421 event pairs, 132 based on Foata normal form. 15/584 useless extension candidates. Maximal degree in co-relation 2497. Up to 373 conditions per place. [2024-10-11 19:41:19,714 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 21 selfloop transitions, 7 changer transitions 22/66 dead transitions. [2024-10-11 19:41:19,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 66 transitions, 620 flow [2024-10-11 19:41:19,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 19:41:19,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 19:41:19,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-10-11 19:41:19,716 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48253968253968255 [2024-10-11 19:41:19,716 INFO L175 Difference]: Start difference. First operand has 74 places, 47 transitions, 414 flow. Second operand 9 states and 152 transitions. [2024-10-11 19:41:19,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 66 transitions, 620 flow [2024-10-11 19:41:19,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 66 transitions, 606 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-11 19:41:19,725 INFO L231 Difference]: Finished difference. Result has 84 places, 42 transitions, 371 flow [2024-10-11 19:41:19,726 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=371, PETRI_PLACES=84, PETRI_TRANSITIONS=42} [2024-10-11 19:41:19,727 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 46 predicate places. [2024-10-11 19:41:19,728 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 42 transitions, 371 flow [2024-10-11 19:41:19,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:19,728 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:41:19,728 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:41:19,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 19:41:19,729 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-11 19:41:19,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:41:19,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1944428557, now seen corresponding path program 2 times [2024-10-11 19:41:19,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:41:19,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845587149] [2024-10-11 19:41:19,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:41:19,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:41:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:41:20,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:41:20,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:41:20,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845587149] [2024-10-11 19:41:20,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845587149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:41:20,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:41:20,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:41:20,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077479255] [2024-10-11 19:41:20,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:41:20,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:41:20,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:41:20,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:41:20,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:41:20,580 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-10-11 19:41:20,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 42 transitions, 371 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:20,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:41:20,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-10-11 19:41:20,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:41:20,890 INFO L124 PetriNetUnfolderBase]: 198/501 cut-off events. [2024-10-11 19:41:20,891 INFO L125 PetriNetUnfolderBase]: For 2940/2947 co-relation queries the response was YES. [2024-10-11 19:41:20,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2203 conditions, 501 events. 198/501 cut-off events. For 2940/2947 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2741 event pairs, 116 based on Foata normal form. 20/504 useless extension candidates. Maximal degree in co-relation 2171. Up to 292 conditions per place. [2024-10-11 19:41:20,896 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 21 selfloop transitions, 8 changer transitions 17/60 dead transitions. [2024-10-11 19:41:20,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 60 transitions, 619 flow [2024-10-11 19:41:20,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 19:41:20,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 19:41:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-10-11 19:41:20,898 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2024-10-11 19:41:20,898 INFO L175 Difference]: Start difference. First operand has 84 places, 42 transitions, 371 flow. Second operand 9 states and 145 transitions. [2024-10-11 19:41:20,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 60 transitions, 619 flow [2024-10-11 19:41:20,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 60 transitions, 521 flow, removed 32 selfloop flow, removed 12 redundant places. [2024-10-11 19:41:20,907 INFO L231 Difference]: Finished difference. Result has 77 places, 38 transitions, 297 flow [2024-10-11 19:41:20,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=297, PETRI_PLACES=77, PETRI_TRANSITIONS=38} [2024-10-11 19:41:20,909 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 39 predicate places. [2024-10-11 19:41:20,909 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 38 transitions, 297 flow [2024-10-11 19:41:20,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:20,910 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:41:20,910 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:41:20,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 19:41:20,910 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-11 19:41:20,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:41:20,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1375089608, now seen corresponding path program 1 times [2024-10-11 19:41:20,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:41:20,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134993350] [2024-10-11 19:41:20,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:41:20,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:41:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:41:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:41:21,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:41:21,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134993350] [2024-10-11 19:41:21,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134993350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:41:21,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:41:21,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:41:21,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467625825] [2024-10-11 19:41:21,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:41:21,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:41:21,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:41:21,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:41:21,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:41:21,074 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-10-11 19:41:21,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 38 transitions, 297 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:21,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:41:21,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-10-11 19:41:21,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:41:21,197 INFO L124 PetriNetUnfolderBase]: 147/329 cut-off events. [2024-10-11 19:41:21,197 INFO L125 PetriNetUnfolderBase]: For 996/997 co-relation queries the response was YES. [2024-10-11 19:41:21,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 329 events. 147/329 cut-off events. For 996/997 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1409 event pairs, 25 based on Foata normal form. 27/345 useless extension candidates. Maximal degree in co-relation 1206. Up to 123 conditions per place. [2024-10-11 19:41:21,200 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 29 selfloop transitions, 6 changer transitions 1/45 dead transitions. [2024-10-11 19:41:21,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 45 transitions, 381 flow [2024-10-11 19:41:21,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:41:21,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:41:21,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2024-10-11 19:41:21,202 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2024-10-11 19:41:21,202 INFO L175 Difference]: Start difference. First operand has 77 places, 38 transitions, 297 flow. Second operand 5 states and 87 transitions. [2024-10-11 19:41:21,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 45 transitions, 381 flow [2024-10-11 19:41:21,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 272 flow, removed 38 selfloop flow, removed 22 redundant places. [2024-10-11 19:41:21,208 INFO L231 Difference]: Finished difference. Result has 56 places, 36 transitions, 195 flow [2024-10-11 19:41:21,209 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=56, PETRI_TRANSITIONS=36} [2024-10-11 19:41:21,209 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 18 predicate places. [2024-10-11 19:41:21,210 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 36 transitions, 195 flow [2024-10-11 19:41:21,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:21,210 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:41:21,210 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:41:21,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 19:41:21,211 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-11 19:41:21,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:41:21,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1073876728, now seen corresponding path program 1 times [2024-10-11 19:41:21,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:41:21,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997745596] [2024-10-11 19:41:21,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:41:21,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:41:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:41:21,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:41:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:41:21,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 19:41:21,373 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:41:21,374 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-10-11 19:41:21,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-10-11 19:41:21,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-10-11 19:41:21,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-10-11 19:41:21,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-10-11 19:41:21,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-10-11 19:41:21,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 19:41:21,378 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:41:21,445 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 19:41:21,446 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 19:41:21,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:41:21 BasicIcfg [2024-10-11 19:41:21,452 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 19:41:21,452 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 19:41:21,452 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 19:41:21,453 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 19:41:21,453 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:41:08" (3/4) ... [2024-10-11 19:41:21,455 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 19:41:21,457 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 19:41:21,457 INFO L158 Benchmark]: Toolchain (without parser) took 14849.04ms. Allocated memory was 180.4MB in the beginning and 515.9MB in the end (delta: 335.5MB). Free memory was 110.8MB in the beginning and 453.0MB in the end (delta: -342.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:41:21,458 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 117.4MB. Free memory is still 78.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:41:21,458 INFO L158 Benchmark]: CACSL2BoogieTranslator took 633.58ms. Allocated memory is still 180.4MB. Free memory was 110.8MB in the beginning and 86.0MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-11 19:41:21,458 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.82ms. Allocated memory is still 180.4MB. Free memory was 86.0MB in the beginning and 150.9MB in the end (delta: -65.0MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-10-11 19:41:21,458 INFO L158 Benchmark]: Boogie Preprocessor took 125.50ms. Allocated memory is still 180.4MB. Free memory was 150.9MB in the beginning and 147.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 19:41:21,458 INFO L158 Benchmark]: RCFGBuilder took 724.51ms. Allocated memory is still 180.4MB. Free memory was 147.9MB in the beginning and 101.5MB in the end (delta: 46.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-10-11 19:41:21,459 INFO L158 Benchmark]: TraceAbstraction took 13255.92ms. Allocated memory was 180.4MB in the beginning and 515.9MB in the end (delta: 335.5MB). Free memory was 100.6MB in the beginning and 454.0MB in the end (delta: -353.4MB). Peak memory consumption was 263.0MB. Max. memory is 16.1GB. [2024-10-11 19:41:21,459 INFO L158 Benchmark]: Witness Printer took 4.41ms. Allocated memory is still 515.9MB. Free memory was 454.0MB in the beginning and 453.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:41:21,460 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.24ms. Allocated memory is still 117.4MB. Free memory is still 78.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 633.58ms. Allocated memory is still 180.4MB. Free memory was 110.8MB in the beginning and 86.0MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.82ms. Allocated memory is still 180.4MB. Free memory was 86.0MB in the beginning and 150.9MB in the end (delta: -65.0MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 125.50ms. Allocated memory is still 180.4MB. Free memory was 150.9MB in the beginning and 147.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 724.51ms. Allocated memory is still 180.4MB. Free memory was 147.9MB in the beginning and 101.5MB in the end (delta: 46.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 13255.92ms. Allocated memory was 180.4MB in the beginning and 515.9MB in the end (delta: 335.5MB). Free memory was 100.6MB in the beginning and 454.0MB in the end (delta: -353.4MB). Peak memory consumption was 263.0MB. Max. memory is 16.1GB. * Witness Printer took 4.41ms. Allocated memory is still 515.9MB. Free memory was 454.0MB in the beginning and 453.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-2, t2476=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L765] 2 y = 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L734] 1 y = 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L737] 1 x = 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L775] 2 __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L747] 1 __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=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, t2475=-2, t2476=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=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 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-2, t2476=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-2, t2476=-1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=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$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L17] 0 __assert_fail ("0", "safe029_power.opt_pso.opt_rmo.opt.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$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=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: 13.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 556 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 514 mSDsluCounter, 447 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 389 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1803 IncrementalHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 58 mSDtfsCounter, 1803 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=662occurred in iteration=10, InterpolantAutomatonStates: 115, 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.5s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 1944 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 19:41:21,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:41:23,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:41:24,037 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:41:24,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:41:24,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:41:24,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:41:24,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:41:24,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:41:24,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:41:24,081 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:41:24,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:41:24,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:41:24,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:41:24,082 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:41:24,083 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:41:24,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:41:24,084 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:41:24,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:41:24,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:41:24,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:41:24,085 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:41:24,085 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:41:24,086 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:41:24,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:41:24,086 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:41:24,087 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:41:24,087 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:41:24,087 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:41:24,088 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:41:24,088 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:41:24,088 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:41:24,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:41:24,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:41:24,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:41:24,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:41:24,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:41:24,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:41:24,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:41:24,091 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:41:24,091 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:41:24,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:41:24,094 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:41:24,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:41:24,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:41:24,095 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:41:24,095 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-clean/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-clean/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 -> 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 [2024-10-11 19:41:24,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:41:24,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:41:24,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:41:24,463 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:41:24,464 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:41:24,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2024-10-11 19:41:26,134 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:41:26,454 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:41:26,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2024-10-11 19:41:26,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/add0952aa/b5924e2c153d407ca4ca660ec7b2061e/FLAG65529d146 [2024-10-11 19:41:26,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/add0952aa/b5924e2c153d407ca4ca660ec7b2061e [2024-10-11 19:41:26,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:41:26,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:41:26,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:41:26,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:41:26,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:41:26,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:41:26" (1/1) ... [2024-10-11 19:41:26,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51ee49bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:26, skipping insertion in model container [2024-10-11 19:41:26,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:41:26" (1/1) ... [2024-10-11 19:41:26,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:41:27,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:41:27,269 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:41:27,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:41:27,387 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:41:27,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:27 WrapperNode [2024-10-11 19:41:27,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:41:27,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:41:27,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:41:27,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:41:27,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:27" (1/1) ... [2024-10-11 19:41:27,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:27" (1/1) ... [2024-10-11 19:41:27,465 INFO L138 Inliner]: procedures = 175, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 126 [2024-10-11 19:41:27,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:41:27,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:41:27,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:41:27,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:41:27,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:27" (1/1) ... [2024-10-11 19:41:27,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:27" (1/1) ... [2024-10-11 19:41:27,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:27" (1/1) ... [2024-10-11 19:41:27,511 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 19:41:27,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:27" (1/1) ... [2024-10-11 19:41:27,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:27" (1/1) ... [2024-10-11 19:41:27,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:27" (1/1) ... [2024-10-11 19:41:27,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:27" (1/1) ... [2024-10-11 19:41:27,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:27" (1/1) ... [2024-10-11 19:41:27,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:27" (1/1) ... [2024-10-11 19:41:27,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:41:27,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:41:27,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:41:27,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:41:27,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:27" (1/1) ... [2024-10-11 19:41:27,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:41:27,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:41:27,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:41:27,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:41:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 19:41:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:41:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:41:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-11 19:41:27,644 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-11 19:41:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-11 19:41:27,644 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-11 19:41:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 19:41:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:41:27,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:41:27,646 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 19:41:27,807 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:41:27,810 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:41:28,061 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:41:28,062 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:41:28,312 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:41:28,312 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 19:41:28,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:41:28 BoogieIcfgContainer [2024-10-11 19:41:28,313 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:41:28,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:41:28,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:41:28,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:41:28,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:41:26" (1/3) ... [2024-10-11 19:41:28,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49edfc26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:41:28, skipping insertion in model container [2024-10-11 19:41:28,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:41:27" (2/3) ... [2024-10-11 19:41:28,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49edfc26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:41:28, skipping insertion in model container [2024-10-11 19:41:28,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:41:28" (3/3) ... [2024-10-11 19:41:28,323 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2024-10-11 19:41:28,341 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:41:28,341 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-11 19:41:28,341 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:41:28,392 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 19:41:28,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 78 flow [2024-10-11 19:41:28,464 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-10-11 19:41:28,464 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:41:28,469 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 48 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-10-11 19:41:28,469 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 78 flow [2024-10-11 19:41:28,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 72 flow [2024-10-11 19:41:28,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:41:28,493 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;@6dbc0f78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:41:28,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 19:41:28,499 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:41:28,500 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-10-11 19:41:28,500 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:41:28,500 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:41:28,501 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 19:41:28,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-11 19:41:28,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:41:28,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1515886333, now seen corresponding path program 1 times [2024-10-11 19:41:28,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:41:28,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972671459] [2024-10-11 19:41:28,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:41:28,530 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:41:28,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:41:28,534 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:41:28,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 19:41:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:41:28,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:41:28,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:41:28,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:41:28,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:41:28,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:41:28,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972671459] [2024-10-11 19:41:28,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972671459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:41:28,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:41:28,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:41:28,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262287962] [2024-10-11 19:41:28,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:41:28,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:41:28,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:41:28,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:41:28,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:41:28,729 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-10-11 19:41:28,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:28,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:41:28,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-10-11 19:41:28,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:41:28,943 INFO L124 PetriNetUnfolderBase]: 146/337 cut-off events. [2024-10-11 19:41:28,943 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:41:28,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 337 events. 146/337 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1782 event pairs, 20 based on Foata normal form. 24/355 useless extension candidates. Maximal degree in co-relation 600. Up to 208 conditions per place. [2024-10-11 19:41:28,949 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 23 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2024-10-11 19:41:28,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 138 flow [2024-10-11 19:41:28,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:41:28,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:41:28,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-10-11 19:41:28,961 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2024-10-11 19:41:28,963 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 72 flow. Second operand 3 states and 74 transitions. [2024-10-11 19:41:28,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 138 flow [2024-10-11 19:41:28,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:41:28,968 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2024-10-11 19:41:28,970 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-10-11 19:41:28,974 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2024-10-11 19:41:28,974 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2024-10-11 19:41:28,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:28,975 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:41:28,975 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:41:28,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 19:41:29,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:41:29,176 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-11 19:41:29,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:41:29,177 INFO L85 PathProgramCache]: Analyzing trace with hash -580687864, now seen corresponding path program 1 times [2024-10-11 19:41:29,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:41:29,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368245168] [2024-10-11 19:41:29,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:41:29,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:41:29,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:41:29,181 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:41:29,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 19:41:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:41:29,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:41:29,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:41:29,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:41:29,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:41:29,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:41:29,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368245168] [2024-10-11 19:41:29,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368245168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:41:29,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:41:29,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:41:29,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931491508] [2024-10-11 19:41:29,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:41:29,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:41:29,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:41:29,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:41:29,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:41:29,330 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-10-11 19:41:29,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:29,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:41:29,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-10-11 19:41:29,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:41:29,505 INFO L124 PetriNetUnfolderBase]: 199/429 cut-off events. [2024-10-11 19:41:29,505 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-10-11 19:41:29,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 429 events. 199/429 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2129 event pairs, 24 based on Foata normal form. 20/443 useless extension candidates. Maximal degree in co-relation 825. Up to 232 conditions per place. [2024-10-11 19:41:29,512 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 30 selfloop transitions, 4 changer transitions 1/44 dead transitions. [2024-10-11 19:41:29,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 172 flow [2024-10-11 19:41:29,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:41:29,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:41:29,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2024-10-11 19:41:29,515 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5785714285714286 [2024-10-11 19:41:29,515 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 4 states and 81 transitions. [2024-10-11 19:41:29,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 172 flow [2024-10-11 19:41:29,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:41:29,518 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 86 flow [2024-10-11 19:41:29,519 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-10-11 19:41:29,519 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2024-10-11 19:41:29,519 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 86 flow [2024-10-11 19:41:29,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:29,521 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:41:29,522 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:41:29,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 19:41:29,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:41:29,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-11 19:41:29,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:41:29,727 INFO L85 PathProgramCache]: Analyzing trace with hash -660020367, now seen corresponding path program 1 times [2024-10-11 19:41:29,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:41:29,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454769208] [2024-10-11 19:41:29,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:41:29,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:41:29,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:41:29,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:41:29,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 19:41:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:41:29,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:41:29,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:41:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:41:29,865 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:41:29,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:41:29,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454769208] [2024-10-11 19:41:29,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454769208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:41:29,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:41:29,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:41:29,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908623783] [2024-10-11 19:41:29,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:41:29,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:41:29,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:41:29,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:41:29,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:41:29,873 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-10-11 19:41:29,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:29,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:41:29,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-10-11 19:41:29,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:41:30,024 INFO L124 PetriNetUnfolderBase]: 92/206 cut-off events. [2024-10-11 19:41:30,024 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2024-10-11 19:41:30,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 206 events. 92/206 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 695 event pairs, 16 based on Foata normal form. 14/214 useless extension candidates. Maximal degree in co-relation 465. Up to 71 conditions per place. [2024-10-11 19:41:30,026 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 26 selfloop transitions, 6 changer transitions 1/42 dead transitions. [2024-10-11 19:41:30,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 181 flow [2024-10-11 19:41:30,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:41:30,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:41:30,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-10-11 19:41:30,029 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-10-11 19:41:30,029 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 86 flow. Second operand 5 states and 90 transitions. [2024-10-11 19:41:30,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 181 flow [2024-10-11 19:41:30,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 172 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-11 19:41:30,031 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 102 flow [2024-10-11 19:41:30,031 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2024-10-11 19:41:30,032 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2024-10-11 19:41:30,033 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 102 flow [2024-10-11 19:41:30,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:30,033 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:41:30,033 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:41:30,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 19:41:30,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:41:30,234 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-11 19:41:30,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:41:30,235 INFO L85 PathProgramCache]: Analyzing trace with hash 2058798058, now seen corresponding path program 1 times [2024-10-11 19:41:30,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:41:30,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200431619] [2024-10-11 19:41:30,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:41:30,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:41:30,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:41:30,239 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:41:30,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 19:41:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:41:30,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:41:30,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:41:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:41:30,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:41:30,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:41:30,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200431619] [2024-10-11 19:41:30,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200431619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:41:30,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:41:30,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:41:30,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578779693] [2024-10-11 19:41:30,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:41:30,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:41:30,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:41:30,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:41:30,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:41:30,372 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-10-11 19:41:30,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:30,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:41:30,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-10-11 19:41:30,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:41:30,422 INFO L124 PetriNetUnfolderBase]: 53/140 cut-off events. [2024-10-11 19:41:30,422 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-10-11 19:41:30,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 140 events. 53/140 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 459 event pairs, 52 based on Foata normal form. 4/131 useless extension candidates. Maximal degree in co-relation 289. Up to 109 conditions per place. [2024-10-11 19:41:30,423 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 14 selfloop transitions, 1 changer transitions 1/29 dead transitions. [2024-10-11 19:41:30,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 132 flow [2024-10-11 19:41:30,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:41:30,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:41:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-10-11 19:41:30,425 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-10-11 19:41:30,425 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 102 flow. Second operand 3 states and 56 transitions. [2024-10-11 19:41:30,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 132 flow [2024-10-11 19:41:30,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 104 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-10-11 19:41:30,426 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 72 flow [2024-10-11 19:41:30,426 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2024-10-11 19:41:30,427 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2024-10-11 19:41:30,428 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 72 flow [2024-10-11 19:41:30,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:30,428 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:41:30,428 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:41:30,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 19:41:30,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:41:30,629 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-11 19:41:30,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:41:30,630 INFO L85 PathProgramCache]: Analyzing trace with hash -2121495888, now seen corresponding path program 1 times [2024-10-11 19:41:30,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:41:30,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962189945] [2024-10-11 19:41:30,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:41:30,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:41:30,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:41:30,634 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:41:30,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 19:41:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:41:30,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:41:30,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:41:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:41:31,093 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:41:31,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:41:31,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962189945] [2024-10-11 19:41:31,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962189945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:41:31,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:41:31,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:41:31,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473974702] [2024-10-11 19:41:31,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:41:31,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:41:31,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:41:31,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:41:31,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:41:31,105 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-10-11 19:41:31,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 72 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-10-11 19:41:31,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:41:31,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-10-11 19:41:31,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:41:31,267 INFO L124 PetriNetUnfolderBase]: 108/263 cut-off events. [2024-10-11 19:41:31,268 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:41:31,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 263 events. 108/263 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1053 event pairs, 55 based on Foata normal form. 4/255 useless extension candidates. Maximal degree in co-relation 503. Up to 127 conditions per place. [2024-10-11 19:41:31,270 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 18 selfloop transitions, 2 changer transitions 11/42 dead transitions. [2024-10-11 19:41:31,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 162 flow [2024-10-11 19:41:31,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:41:31,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:41:31,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-10-11 19:41:31,271 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5257142857142857 [2024-10-11 19:41:31,271 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 72 flow. Second operand 5 states and 92 transitions. [2024-10-11 19:41:31,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 162 flow [2024-10-11 19:41:31,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:41:31,273 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 83 flow [2024-10-11 19:41:31,273 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=83, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2024-10-11 19:41:31,274 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2024-10-11 19:41:31,274 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 83 flow [2024-10-11 19:41:31,274 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-10-11 19:41:31,276 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:41:31,277 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:41:31,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 19:41:31,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:41:31,478 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-11 19:41:31,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:41:31,478 INFO L85 PathProgramCache]: Analyzing trace with hash -14361552, now seen corresponding path program 2 times [2024-10-11 19:41:31,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:41:31,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275655532] [2024-10-11 19:41:31,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:41:31,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:41:31,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:41:31,482 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:41:31,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 19:41:31,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 19:41:31,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:41:31,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 19:41:31,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:41:31,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:41:31,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:41:31,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:41:31,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275655532] [2024-10-11 19:41:31,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275655532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:41:31,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:41:31,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 19:41:31,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105909777] [2024-10-11 19:41:31,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:41:31,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 19:41:31,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:41:31,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 19:41:31,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 19:41:31,904 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-10-11 19:41:31,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 83 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:31,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:41:31,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-10-11 19:41:31,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:41:32,100 INFO L124 PetriNetUnfolderBase]: 74/194 cut-off events. [2024-10-11 19:41:32,100 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 19:41:32,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 194 events. 74/194 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 713 event pairs, 35 based on Foata normal form. 4/189 useless extension candidates. Maximal degree in co-relation 389. Up to 80 conditions per place. [2024-10-11 19:41:32,101 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 16 selfloop transitions, 3 changer transitions 13/44 dead transitions. [2024-10-11 19:41:32,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 183 flow [2024-10-11 19:41:32,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 19:41:32,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 19:41:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-10-11 19:41:32,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5061224489795918 [2024-10-11 19:41:32,104 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 83 flow. Second operand 7 states and 124 transitions. [2024-10-11 19:41:32,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 183 flow [2024-10-11 19:41:32,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 169 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-11 19:41:32,106 INFO L231 Difference]: Finished difference. Result has 46 places, 28 transitions, 90 flow [2024-10-11 19:41:32,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=90, PETRI_PLACES=46, PETRI_TRANSITIONS=28} [2024-10-11 19:41:32,107 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2024-10-11 19:41:32,107 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 90 flow [2024-10-11 19:41:32,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:41:32,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:41:32,109 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:41:32,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 19:41:32,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:41:32,313 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-11 19:41:32,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:41:32,313 INFO L85 PathProgramCache]: Analyzing trace with hash -531563954, now seen corresponding path program 3 times [2024-10-11 19:41:32,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:41:32,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581797594] [2024-10-11 19:41:32,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:41:32,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:41:32,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:41:32,317 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:41:32,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 19:41:32,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-11 19:41:32,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-11 19:41:32,400 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:41:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:41:32,489 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-11 19:41:32,489 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:41:32,490 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-10-11 19:41:32,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-10-11 19:41:32,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-10-11 19:41:32,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-10-11 19:41:32,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-10-11 19:41:32,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-10-11 19:41:32,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 19:41:32,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:41:32,695 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-10-11 19:41:32,775 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 19:41:32,776 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 19:41:32,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:41:32 BasicIcfg [2024-10-11 19:41:32,781 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 19:41:32,782 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 19:41:32,782 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 19:41:32,782 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 19:41:32,783 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:41:28" (3/4) ... [2024-10-11 19:41:32,788 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 19:41:32,790 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 19:41:32,790 INFO L158 Benchmark]: Toolchain (without parser) took 6072.28ms. Allocated memory was 62.9MB in the beginning and 111.1MB in the end (delta: 48.2MB). Free memory was 37.6MB in the beginning and 50.3MB in the end (delta: -12.7MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2024-10-11 19:41:32,791 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 44.0MB. Free memory was 20.6MB in the beginning and 20.5MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:41:32,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 669.40ms. Allocated memory is still 62.9MB. Free memory was 37.4MB in the beginning and 29.9MB in the end (delta: 7.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 19:41:32,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.53ms. Allocated memory is still 62.9MB. Free memory was 29.9MB in the beginning and 27.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:41:32,792 INFO L158 Benchmark]: Boogie Preprocessor took 79.42ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 27.1MB in the beginning and 53.4MB in the end (delta: -26.3MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-10-11 19:41:32,792 INFO L158 Benchmark]: RCFGBuilder took 767.62ms. Allocated memory is still 75.5MB. Free memory was 53.4MB in the beginning and 43.6MB in the end (delta: 9.8MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2024-10-11 19:41:32,793 INFO L158 Benchmark]: TraceAbstraction took 4465.47ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 43.1MB in the beginning and 50.3MB in the end (delta: -7.2MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2024-10-11 19:41:32,793 INFO L158 Benchmark]: Witness Printer took 7.99ms. Allocated memory is still 111.1MB. Free memory is still 50.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:41:32,795 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.20ms. Allocated memory is still 44.0MB. Free memory was 20.6MB in the beginning and 20.5MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 669.40ms. Allocated memory is still 62.9MB. Free memory was 37.4MB in the beginning and 29.9MB in the end (delta: 7.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.53ms. Allocated memory is still 62.9MB. Free memory was 29.9MB in the beginning and 27.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.42ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 27.1MB in the beginning and 53.4MB in the end (delta: -26.3MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * RCFGBuilder took 767.62ms. Allocated memory is still 75.5MB. Free memory was 53.4MB in the beginning and 43.6MB in the end (delta: 9.8MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4465.47ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 43.1MB in the beginning and 50.3MB in the end (delta: -7.2MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * Witness Printer took 7.99ms. Allocated memory is still 111.1MB. Free memory is still 50.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-1, t2476=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L765] 2 y = 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L734] 1 y = 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L737] 1 x = 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L775] 2 __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L747] 1 __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=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, t2475=-1, t2476=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=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 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-1, t2476=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-1, t2476=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=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$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L17] 0 __assert_fail ("0", "safe029_power.opt_pso.opt_rmo.opt.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$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=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.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 133 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 422 IncrementalHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 3 mSDtfsCounter, 422 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 82 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.9s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 423 SizeOfPredicates, 7 NumberOfNonLiveVariables, 538 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-10-11 19:41:32,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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