./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:30:04,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:30:04,410 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 21:30:04,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:30:04,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:30:04,443 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:30:04,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:30:04,444 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:30:04,445 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:30:04,446 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:30:04,446 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:30:04,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:30:04,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:30:04,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:30:04,450 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:30:04,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:30:04,450 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:30:04,450 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:30:04,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:30:04,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:30:04,451 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:30:04,453 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:30:04,454 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:30:04,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:30:04,454 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:30:04,454 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:30:04,455 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:30:04,455 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:30:04,455 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:30:04,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:30:04,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:30:04,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:30:04,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:30:04,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:30:04,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:30:04,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:30:04,460 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 21:30:04,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 21:30:04,460 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:30:04,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:30:04,461 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:30:04,461 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:30:04,461 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 [2024-11-22 21:30:04,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:30:04,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:30:04,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:30:04,731 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:30:04,731 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:30:04,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-11-22 21:30:06,213 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:30:06,441 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:30:06,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-11-22 21:30:06,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4094c92c0/93caaf9704eb442ead2510b870dd7784/FLAG4b2e47914 [2024-11-22 21:30:06,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4094c92c0/93caaf9704eb442ead2510b870dd7784 [2024-11-22 21:30:06,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:30:06,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:30:06,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:30:06,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:30:06,795 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:30:06,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:30:06" (1/1) ... [2024-11-22 21:30:06,796 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@733426b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:06, skipping insertion in model container [2024-11-22 21:30:06,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:30:06" (1/1) ... [2024-11-22 21:30:06,868 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:30:07,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:30:07,339 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:30:07,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:30:07,453 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:30:07,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:07 WrapperNode [2024-11-22 21:30:07,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:30:07,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:30:07,455 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:30:07,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:30:07,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:07" (1/1) ... [2024-11-22 21:30:07,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:07" (1/1) ... [2024-11-22 21:30:07,528 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-11-22 21:30:07,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:30:07,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:30:07,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:30:07,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:30:07,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:07" (1/1) ... [2024-11-22 21:30:07,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:07" (1/1) ... [2024-11-22 21:30:07,551 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:07" (1/1) ... [2024-11-22 21:30:07,579 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 21:30:07,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:07" (1/1) ... [2024-11-22 21:30:07,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:07" (1/1) ... [2024-11-22 21:30:07,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:07" (1/1) ... [2024-11-22 21:30:07,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:07" (1/1) ... [2024-11-22 21:30:07,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:07" (1/1) ... [2024-11-22 21:30:07,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:07" (1/1) ... [2024-11-22 21:30:07,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:30:07,609 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:30:07,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:30:07,609 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:30:07,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:07" (1/1) ... [2024-11-22 21:30:07,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:30:07,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:30:07,646 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 21:30:07,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 21:30:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 21:30:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:30:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-22 21:30:07,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-22 21:30:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-22 21:30:07,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-22 21:30:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-22 21:30:07,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-22 21:30:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 21:30:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 21:30:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:30:07,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:30:07,699 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:30:07,849 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:30:07,851 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:30:08,240 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:30:08,240 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:30:08,507 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:30:08,508 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 21:30:08,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:30:08 BoogieIcfgContainer [2024-11-22 21:30:08,509 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:30:08,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:30:08,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:30:08,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:30:08,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:30:06" (1/3) ... [2024-11-22 21:30:08,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33181b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:30:08, skipping insertion in model container [2024-11-22 21:30:08,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:07" (2/3) ... [2024-11-22 21:30:08,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33181b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:30:08, skipping insertion in model container [2024-11-22 21:30:08,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:30:08" (3/3) ... [2024-11-22 21:30:08,518 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-11-22 21:30:08,533 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:30:08,535 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-22 21:30:08,535 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:30:08,593 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:30:08,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-22 21:30:08,659 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-22 21:30:08,659 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:30:08,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-11-22 21:30:08,665 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-22 21:30:08,671 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-22 21:30:08,683 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:30:08,690 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;@29fc7b15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:30:08,691 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-22 21:30:08,694 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:30:08,694 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-22 21:30:08,694 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:30:08,694 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:08,695 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-22 21:30:08,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:08,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:08,701 INFO L85 PathProgramCache]: Analyzing trace with hash 14218462, now seen corresponding path program 1 times [2024-11-22 21:30:08,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:08,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144743315] [2024-11-22 21:30:08,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:08,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:09,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:09,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:09,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144743315] [2024-11-22 21:30:09,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144743315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:09,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:09,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:30:09,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597067660] [2024-11-22 21:30:09,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:09,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:30:09,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:09,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:30:09,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:30:09,153 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-22 21:30:09,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:09,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:09,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-22 21:30:09,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:09,760 INFO L124 PetriNetUnfolderBase]: 1178/2120 cut-off events. [2024-11-22 21:30:09,760 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-22 21:30:09,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3910 conditions, 2120 events. 1178/2120 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14211 event pairs, 188 based on Foata normal form. 120/2232 useless extension candidates. Maximal degree in co-relation 3899. Up to 1420 conditions per place. [2024-11-22 21:30:09,783 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 37 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2024-11-22 21:30:09,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 207 flow [2024-11-22 21:30:09,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:30:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:30:09,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-22 21:30:09,794 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7348484848484849 [2024-11-22 21:30:09,796 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 97 transitions. [2024-11-22 21:30:09,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 207 flow [2024-11-22 21:30:09,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 202 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:30:09,800 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-22 21:30:09,802 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-22 21:30:09,807 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-22 21:30:09,808 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-22 21:30:09,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:09,808 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:09,808 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:09,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 21:30:09,809 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:09,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:09,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1747009556, now seen corresponding path program 1 times [2024-11-22 21:30:09,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:09,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656903426] [2024-11-22 21:30:09,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:09,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:09,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:09,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656903426] [2024-11-22 21:30:09,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656903426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:09,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:09,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:30:09,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106162653] [2024-11-22 21:30:09,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:09,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:30:09,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:09,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:30:09,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:30:09,932 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-22 21:30:09,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:09,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:09,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-22 21:30:09,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:10,285 INFO L124 PetriNetUnfolderBase]: 1045/1829 cut-off events. [2024-11-22 21:30:10,286 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-11-22 21:30:10,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3553 conditions, 1829 events. 1045/1829 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11565 event pairs, 1045 based on Foata normal form. 60/1862 useless extension candidates. Maximal degree in co-relation 3543. Up to 1558 conditions per place. [2024-11-22 21:30:10,295 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 20 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-22 21:30:10,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 124 flow [2024-11-22 21:30:10,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:30:10,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:30:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-22 21:30:10,298 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2024-11-22 21:30:10,299 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 71 transitions. [2024-11-22 21:30:10,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 124 flow [2024-11-22 21:30:10,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:30:10,302 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-11-22 21:30:10,302 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-11-22 21:30:10,303 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-11-22 21:30:10,303 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-11-22 21:30:10,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:10,303 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:10,304 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:10,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 21:30:10,304 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:10,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:10,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1747011048, now seen corresponding path program 1 times [2024-11-22 21:30:10,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:10,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601010317] [2024-11-22 21:30:10,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:10,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:11,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:11,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601010317] [2024-11-22 21:30:11,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601010317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:11,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:11,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:30:11,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147420154] [2024-11-22 21:30:11,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:11,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:30:11,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:11,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:30:11,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:30:11,151 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-11-22 21:30:11,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:11,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:11,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-11-22 21:30:11,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:12,475 INFO L124 PetriNetUnfolderBase]: 2817/4661 cut-off events. [2024-11-22 21:30:12,476 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:30:12,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8851 conditions, 4661 events. 2817/4661 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 30576 event pairs, 373 based on Foata normal form. 0/4553 useless extension candidates. Maximal degree in co-relation 8845. Up to 2290 conditions per place. [2024-11-22 21:30:12,498 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 43 selfloop transitions, 11 changer transitions 80/144 dead transitions. [2024-11-22 21:30:12,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 144 transitions, 572 flow [2024-11-22 21:30:12,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 21:30:12,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-22 21:30:12,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 305 transitions. [2024-11-22 21:30:12,501 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5776515151515151 [2024-11-22 21:30:12,501 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 12 states and 305 transitions. [2024-11-22 21:30:12,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 144 transitions, 572 flow [2024-11-22 21:30:12,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 144 transitions, 571 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:30:12,507 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 185 flow [2024-11-22 21:30:12,507 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=185, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2024-11-22 21:30:12,508 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2024-11-22 21:30:12,508 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 185 flow [2024-11-22 21:30:12,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:12,508 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:12,508 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:12,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 21:30:12,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:12,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:12,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2130500679, now seen corresponding path program 1 times [2024-11-22 21:30:12,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:12,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83916824] [2024-11-22 21:30:12,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:12,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:13,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:13,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:13,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83916824] [2024-11-22 21:30:13,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83916824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:13,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:13,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:30:13,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912745995] [2024-11-22 21:30:13,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:13,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:30:13,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:13,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:30:13,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:30:13,059 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-11-22 21:30:13,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 185 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:13,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:13,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-11-22 21:30:13,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:14,141 INFO L124 PetriNetUnfolderBase]: 2058/3358 cut-off events. [2024-11-22 21:30:14,141 INFO L125 PetriNetUnfolderBase]: For 5465/5467 co-relation queries the response was YES. [2024-11-22 21:30:14,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12005 conditions, 3358 events. 2058/3358 cut-off events. For 5465/5467 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 20371 event pairs, 318 based on Foata normal form. 105/3456 useless extension candidates. Maximal degree in co-relation 11989. Up to 1882 conditions per place. [2024-11-22 21:30:14,171 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 43 selfloop transitions, 11 changer transitions 58/122 dead transitions. [2024-11-22 21:30:14,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 122 transitions, 819 flow [2024-11-22 21:30:14,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:30:14,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-22 21:30:14,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 240 transitions. [2024-11-22 21:30:14,174 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-11-22 21:30:14,174 INFO L175 Difference]: Start difference. First operand has 62 places, 42 transitions, 185 flow. Second operand 10 states and 240 transitions. [2024-11-22 21:30:14,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 122 transitions, 819 flow [2024-11-22 21:30:14,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 122 transitions, 749 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-11-22 21:30:14,210 INFO L231 Difference]: Finished difference. Result has 66 places, 48 transitions, 280 flow [2024-11-22 21:30:14,210 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=280, PETRI_PLACES=66, PETRI_TRANSITIONS=48} [2024-11-22 21:30:14,211 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2024-11-22 21:30:14,211 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 48 transitions, 280 flow [2024-11-22 21:30:14,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:14,212 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:14,212 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:14,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 21:30:14,212 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:14,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:14,213 INFO L85 PathProgramCache]: Analyzing trace with hash 578651416, now seen corresponding path program 1 times [2024-11-22 21:30:14,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:14,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916033661] [2024-11-22 21:30:14,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:14,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:14,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:14,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:14,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916033661] [2024-11-22 21:30:14,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916033661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:14,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:14,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:30:14,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391565728] [2024-11-22 21:30:14,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:14,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:30:14,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:14,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:30:14,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:30:14,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-22 21:30:14,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 48 transitions, 280 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:14,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:14,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-22 21:30:14,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:15,046 INFO L124 PetriNetUnfolderBase]: 1532/2596 cut-off events. [2024-11-22 21:30:15,047 INFO L125 PetriNetUnfolderBase]: For 6098/6336 co-relation queries the response was YES. [2024-11-22 21:30:15,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9700 conditions, 2596 events. 1532/2596 cut-off events. For 6098/6336 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 16321 event pairs, 334 based on Foata normal form. 212/2747 useless extension candidates. Maximal degree in co-relation 9678. Up to 1281 conditions per place. [2024-11-22 21:30:15,074 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 46 selfloop transitions, 8 changer transitions 28/100 dead transitions. [2024-11-22 21:30:15,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 100 transitions, 761 flow [2024-11-22 21:30:15,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:30:15,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:30:15,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-11-22 21:30:15,076 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5584415584415584 [2024-11-22 21:30:15,076 INFO L175 Difference]: Start difference. First operand has 66 places, 48 transitions, 280 flow. Second operand 7 states and 172 transitions. [2024-11-22 21:30:15,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 100 transitions, 761 flow [2024-11-22 21:30:15,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 100 transitions, 734 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-11-22 21:30:15,094 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 329 flow [2024-11-22 21:30:15,094 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=329, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2024-11-22 21:30:15,095 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2024-11-22 21:30:15,095 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 329 flow [2024-11-22 21:30:15,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:15,096 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:15,096 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:15,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 21:30:15,096 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:15,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:15,097 INFO L85 PathProgramCache]: Analyzing trace with hash 87620974, now seen corresponding path program 1 times [2024-11-22 21:30:15,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:15,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195041975] [2024-11-22 21:30:15,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:15,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:15,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:15,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195041975] [2024-11-22 21:30:15,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195041975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:15,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:15,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:30:15,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554953026] [2024-11-22 21:30:15,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:15,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:30:15,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:15,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:30:15,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:30:15,617 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-22 21:30:15,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:15,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:15,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-22 21:30:15,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:16,712 INFO L124 PetriNetUnfolderBase]: 3382/5603 cut-off events. [2024-11-22 21:30:16,712 INFO L125 PetriNetUnfolderBase]: For 9475/9723 co-relation queries the response was YES. [2024-11-22 21:30:16,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20374 conditions, 5603 events. 3382/5603 cut-off events. For 9475/9723 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 37817 event pairs, 385 based on Foata normal form. 286/5821 useless extension candidates. Maximal degree in co-relation 20350. Up to 2416 conditions per place. [2024-11-22 21:30:16,744 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 49 selfloop transitions, 5 changer transitions 56/127 dead transitions. [2024-11-22 21:30:16,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 127 transitions, 982 flow [2024-11-22 21:30:16,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:30:16,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:30:16,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2024-11-22 21:30:16,745 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5710227272727273 [2024-11-22 21:30:16,746 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 329 flow. Second operand 8 states and 201 transitions. [2024-11-22 21:30:16,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 127 transitions, 982 flow [2024-11-22 21:30:16,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 127 transitions, 964 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-11-22 21:30:16,769 INFO L231 Difference]: Finished difference. Result has 75 places, 55 transitions, 372 flow [2024-11-22 21:30:16,769 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=372, PETRI_PLACES=75, PETRI_TRANSITIONS=55} [2024-11-22 21:30:16,770 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places. [2024-11-22 21:30:16,770 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 55 transitions, 372 flow [2024-11-22 21:30:16,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:16,770 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:16,770 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:16,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 21:30:16,771 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:16,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:16,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1813059487, now seen corresponding path program 1 times [2024-11-22 21:30:16,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:16,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613638244] [2024-11-22 21:30:16,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:16,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:17,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:17,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613638244] [2024-11-22 21:30:17,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613638244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:17,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:17,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:30:17,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530195999] [2024-11-22 21:30:17,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:17,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:30:17,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:17,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:30:17,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:30:17,112 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-11-22 21:30:17,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 55 transitions, 372 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 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-11-22 21:30:17,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:17,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-11-22 21:30:17,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:17,928 INFO L124 PetriNetUnfolderBase]: 3279/5566 cut-off events. [2024-11-22 21:30:17,928 INFO L125 PetriNetUnfolderBase]: For 16622/16628 co-relation queries the response was YES. [2024-11-22 21:30:17,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22307 conditions, 5566 events. 3279/5566 cut-off events. For 16622/16628 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 39182 event pairs, 961 based on Foata normal form. 83/5544 useless extension candidates. Maximal degree in co-relation 22279. Up to 2233 conditions per place. [2024-11-22 21:30:17,964 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 48 selfloop transitions, 6 changer transitions 49/114 dead transitions. [2024-11-22 21:30:17,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 114 transitions, 982 flow [2024-11-22 21:30:17,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:30:17,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:30:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-11-22 21:30:17,966 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.564935064935065 [2024-11-22 21:30:17,966 INFO L175 Difference]: Start difference. First operand has 75 places, 55 transitions, 372 flow. Second operand 7 states and 174 transitions. [2024-11-22 21:30:17,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 114 transitions, 982 flow [2024-11-22 21:30:18,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 114 transitions, 946 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-11-22 21:30:18,087 INFO L231 Difference]: Finished difference. Result has 79 places, 48 transitions, 318 flow [2024-11-22 21:30:18,087 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=318, PETRI_PLACES=79, PETRI_TRANSITIONS=48} [2024-11-22 21:30:18,088 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 30 predicate places. [2024-11-22 21:30:18,088 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 48 transitions, 318 flow [2024-11-22 21:30:18,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 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-11-22 21:30:18,088 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:18,089 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:18,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 21:30:18,089 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:18,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:18,090 INFO L85 PathProgramCache]: Analyzing trace with hash -2057510662, now seen corresponding path program 1 times [2024-11-22 21:30:18,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:18,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902048807] [2024-11-22 21:30:18,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:18,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:18,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:18,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902048807] [2024-11-22 21:30:18,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902048807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:18,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:18,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:30:18,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326275683] [2024-11-22 21:30:18,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:18,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:30:18,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:18,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:30:18,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:30:18,863 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-22 21:30:18,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 48 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:18,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:18,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-22 21:30:18,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:19,438 INFO L124 PetriNetUnfolderBase]: 2157/3720 cut-off events. [2024-11-22 21:30:19,438 INFO L125 PetriNetUnfolderBase]: For 11363/11467 co-relation queries the response was YES. [2024-11-22 21:30:19,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14718 conditions, 3720 events. 2157/3720 cut-off events. For 11363/11467 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 24135 event pairs, 1061 based on Foata normal form. 147/3826 useless extension candidates. Maximal degree in co-relation 14687. Up to 2689 conditions per place. [2024-11-22 21:30:19,463 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 49 selfloop transitions, 10 changer transitions 31/106 dead transitions. [2024-11-22 21:30:19,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 106 transitions, 858 flow [2024-11-22 21:30:19,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:30:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:30:19,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-11-22 21:30:19,466 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5568181818181818 [2024-11-22 21:30:19,466 INFO L175 Difference]: Start difference. First operand has 79 places, 48 transitions, 318 flow. Second operand 8 states and 196 transitions. [2024-11-22 21:30:19,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 106 transitions, 858 flow [2024-11-22 21:30:19,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 106 transitions, 793 flow, removed 20 selfloop flow, removed 11 redundant places. [2024-11-22 21:30:19,485 INFO L231 Difference]: Finished difference. Result has 73 places, 55 transitions, 387 flow [2024-11-22 21:30:19,485 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=387, PETRI_PLACES=73, PETRI_TRANSITIONS=55} [2024-11-22 21:30:19,486 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 24 predicate places. [2024-11-22 21:30:19,486 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 55 transitions, 387 flow [2024-11-22 21:30:19,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:19,487 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:19,487 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:19,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 21:30:19,487 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:19,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:19,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1442852716, now seen corresponding path program 2 times [2024-11-22 21:30:19,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:19,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110235] [2024-11-22 21:30:19,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:30:19,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:19,522 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:30:19,523 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:30:20,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:20,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:20,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110235] [2024-11-22 21:30:20,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:20,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:20,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 21:30:20,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571055609] [2024-11-22 21:30:20,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:20,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 21:30:20,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:20,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 21:30:20,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-22 21:30:20,378 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-22 21:30:20,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 55 transitions, 387 flow. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:20,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:20,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-22 21:30:20,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:21,248 INFO L124 PetriNetUnfolderBase]: 2177/3751 cut-off events. [2024-11-22 21:30:21,248 INFO L125 PetriNetUnfolderBase]: For 10661/10768 co-relation queries the response was YES. [2024-11-22 21:30:21,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15381 conditions, 3751 events. 2177/3751 cut-off events. For 10661/10768 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 24392 event pairs, 1016 based on Foata normal form. 151/3861 useless extension candidates. Maximal degree in co-relation 15353. Up to 2696 conditions per place. [2024-11-22 21:30:21,269 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 59 selfloop transitions, 20 changer transitions 40/135 dead transitions. [2024-11-22 21:30:21,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 135 transitions, 1180 flow [2024-11-22 21:30:21,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 21:30:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-22 21:30:21,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 280 transitions. [2024-11-22 21:30:21,271 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2024-11-22 21:30:21,271 INFO L175 Difference]: Start difference. First operand has 73 places, 55 transitions, 387 flow. Second operand 12 states and 280 transitions. [2024-11-22 21:30:21,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 135 transitions, 1180 flow [2024-11-22 21:30:21,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 135 transitions, 1120 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-11-22 21:30:21,292 INFO L231 Difference]: Finished difference. Result has 82 places, 67 transitions, 561 flow [2024-11-22 21:30:21,292 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=561, PETRI_PLACES=82, PETRI_TRANSITIONS=67} [2024-11-22 21:30:21,293 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 33 predicate places. [2024-11-22 21:30:21,293 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 67 transitions, 561 flow [2024-11-22 21:30:21,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:21,294 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:21,294 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] [2024-11-22 21:30:21,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 21:30:21,294 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:21,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:21,295 INFO L85 PathProgramCache]: Analyzing trace with hash 751619244, now seen corresponding path program 1 times [2024-11-22 21:30:21,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:21,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696459824] [2024-11-22 21:30:21,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:21,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:21,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:21,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696459824] [2024-11-22 21:30:21,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696459824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:21,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:21,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:30:21,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286641661] [2024-11-22 21:30:21,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:21,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:30:21,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:21,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:30:21,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:30:21,720 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-22 21:30:21,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 67 transitions, 561 flow. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:21,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:21,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-22 21:30:21,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:22,721 INFO L124 PetriNetUnfolderBase]: 3098/5299 cut-off events. [2024-11-22 21:30:22,721 INFO L125 PetriNetUnfolderBase]: For 21157/21303 co-relation queries the response was YES. [2024-11-22 21:30:22,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23460 conditions, 5299 events. 3098/5299 cut-off events. For 21157/21303 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 36790 event pairs, 905 based on Foata normal form. 222/5494 useless extension candidates. Maximal degree in co-relation 23428. Up to 2308 conditions per place. [2024-11-22 21:30:22,758 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 63 selfloop transitions, 13 changer transitions 33/125 dead transitions. [2024-11-22 21:30:22,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 125 transitions, 1178 flow [2024-11-22 21:30:22,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:30:22,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:30:22,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-11-22 21:30:22,760 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-22 21:30:22,760 INFO L175 Difference]: Start difference. First operand has 82 places, 67 transitions, 561 flow. Second operand 7 states and 175 transitions. [2024-11-22 21:30:22,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 125 transitions, 1178 flow [2024-11-22 21:30:22,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 125 transitions, 1098 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-11-22 21:30:22,890 INFO L231 Difference]: Finished difference. Result has 81 places, 71 transitions, 588 flow [2024-11-22 21:30:22,892 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=588, PETRI_PLACES=81, PETRI_TRANSITIONS=71} [2024-11-22 21:30:22,893 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 32 predicate places. [2024-11-22 21:30:22,893 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 71 transitions, 588 flow [2024-11-22 21:30:22,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:22,895 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:22,895 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] [2024-11-22 21:30:22,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 21:30:22,895 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:22,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:22,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2106820864, now seen corresponding path program 2 times [2024-11-22 21:30:22,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:22,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232571506] [2024-11-22 21:30:22,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:30:22,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:22,938 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:30:22,940 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:30:24,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:24,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:24,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232571506] [2024-11-22 21:30:24,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232571506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:24,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:24,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 21:30:24,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128959330] [2024-11-22 21:30:24,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:24,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 21:30:24,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:24,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 21:30:24,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-22 21:30:24,101 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-22 21:30:24,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 71 transitions, 588 flow. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:24,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:24,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-22 21:30:24,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:24,873 INFO L124 PetriNetUnfolderBase]: 2220/3924 cut-off events. [2024-11-22 21:30:24,873 INFO L125 PetriNetUnfolderBase]: For 16893/17020 co-relation queries the response was YES. [2024-11-22 21:30:24,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17489 conditions, 3924 events. 2220/3924 cut-off events. For 16893/17020 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 26613 event pairs, 385 based on Foata normal form. 202/4116 useless extension candidates. Maximal degree in co-relation 17456. Up to 2325 conditions per place. [2024-11-22 21:30:24,896 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 75 selfloop transitions, 24 changer transitions 26/141 dead transitions. [2024-11-22 21:30:24,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 141 transitions, 1353 flow [2024-11-22 21:30:24,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:30:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:30:24,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-11-22 21:30:24,898 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5738636363636364 [2024-11-22 21:30:24,898 INFO L175 Difference]: Start difference. First operand has 81 places, 71 transitions, 588 flow. Second operand 8 states and 202 transitions. [2024-11-22 21:30:24,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 141 transitions, 1353 flow [2024-11-22 21:30:24,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 141 transitions, 1307 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-11-22 21:30:24,931 INFO L231 Difference]: Finished difference. Result has 87 places, 84 transitions, 804 flow [2024-11-22 21:30:24,931 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=804, PETRI_PLACES=87, PETRI_TRANSITIONS=84} [2024-11-22 21:30:24,932 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 38 predicate places. [2024-11-22 21:30:24,932 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 804 flow [2024-11-22 21:30:24,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:24,932 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:24,933 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] [2024-11-22 21:30:24,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 21:30:24,933 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:24,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:24,933 INFO L85 PathProgramCache]: Analyzing trace with hash 992712498, now seen corresponding path program 3 times [2024-11-22 21:30:24,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:24,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202151173] [2024-11-22 21:30:24,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:30:24,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:24,976 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 21:30:24,980 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:30:25,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:25,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:25,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202151173] [2024-11-22 21:30:25,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202151173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:25,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:25,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 21:30:25,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772574232] [2024-11-22 21:30:25,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:25,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 21:30:25,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:25,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 21:30:25,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-22 21:30:25,981 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-22 21:30:25,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 804 flow. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:25,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:25,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-22 21:30:25,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:26,817 INFO L124 PetriNetUnfolderBase]: 2242/4020 cut-off events. [2024-11-22 21:30:26,817 INFO L125 PetriNetUnfolderBase]: For 23834/23973 co-relation queries the response was YES. [2024-11-22 21:30:26,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19651 conditions, 4020 events. 2242/4020 cut-off events. For 23834/23973 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 27957 event pairs, 426 based on Foata normal form. 206/4213 useless extension candidates. Maximal degree in co-relation 19615. Up to 2411 conditions per place. [2024-11-22 21:30:26,839 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 77 selfloop transitions, 27 changer transitions 26/146 dead transitions. [2024-11-22 21:30:26,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 146 transitions, 1616 flow [2024-11-22 21:30:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:30:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:30:26,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-11-22 21:30:26,841 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5539772727272727 [2024-11-22 21:30:26,841 INFO L175 Difference]: Start difference. First operand has 87 places, 84 transitions, 804 flow. Second operand 8 states and 195 transitions. [2024-11-22 21:30:26,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 146 transitions, 1616 flow [2024-11-22 21:30:26,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 146 transitions, 1554 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-11-22 21:30:26,875 INFO L231 Difference]: Finished difference. Result has 93 places, 93 transitions, 995 flow [2024-11-22 21:30:26,875 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=995, PETRI_PLACES=93, PETRI_TRANSITIONS=93} [2024-11-22 21:30:26,876 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 44 predicate places. [2024-11-22 21:30:26,876 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 93 transitions, 995 flow [2024-11-22 21:30:26,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:26,876 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:26,877 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] [2024-11-22 21:30:26,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 21:30:26,877 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:26,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:26,877 INFO L85 PathProgramCache]: Analyzing trace with hash 888539955, now seen corresponding path program 1 times [2024-11-22 21:30:26,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:26,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909427509] [2024-11-22 21:30:26,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:26,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:27,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:27,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:27,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909427509] [2024-11-22 21:30:27,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909427509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:27,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:27,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 21:30:27,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937085947] [2024-11-22 21:30:27,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:27,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 21:30:27,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:27,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 21:30:27,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-22 21:30:27,730 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-22 21:30:27,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 93 transitions, 995 flow. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:27,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:27,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-22 21:30:27,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:28,594 INFO L124 PetriNetUnfolderBase]: 2008/3632 cut-off events. [2024-11-22 21:30:28,594 INFO L125 PetriNetUnfolderBase]: For 26046/26129 co-relation queries the response was YES. [2024-11-22 21:30:28,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18827 conditions, 3632 events. 2008/3632 cut-off events. For 26046/26129 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 25062 event pairs, 894 based on Foata normal form. 95/3699 useless extension candidates. Maximal degree in co-relation 18788. Up to 2687 conditions per place. [2024-11-22 21:30:28,621 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 82 selfloop transitions, 28 changer transitions 31/157 dead transitions. [2024-11-22 21:30:28,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 157 transitions, 1760 flow [2024-11-22 21:30:28,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:30:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-22 21:30:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 237 transitions. [2024-11-22 21:30:28,623 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5386363636363637 [2024-11-22 21:30:28,623 INFO L175 Difference]: Start difference. First operand has 93 places, 93 transitions, 995 flow. Second operand 10 states and 237 transitions. [2024-11-22 21:30:28,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 157 transitions, 1760 flow [2024-11-22 21:30:28,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 157 transitions, 1683 flow, removed 32 selfloop flow, removed 4 redundant places. [2024-11-22 21:30:28,657 INFO L231 Difference]: Finished difference. Result has 102 places, 104 transitions, 1132 flow [2024-11-22 21:30:28,657 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1132, PETRI_PLACES=102, PETRI_TRANSITIONS=104} [2024-11-22 21:30:28,657 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 53 predicate places. [2024-11-22 21:30:28,658 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 104 transitions, 1132 flow [2024-11-22 21:30:28,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:28,658 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:28,658 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:28,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 21:30:28,659 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:28,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:28,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1373179952, now seen corresponding path program 1 times [2024-11-22 21:30:28,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:28,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554859299] [2024-11-22 21:30:28,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:28,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:28,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:28,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:28,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554859299] [2024-11-22 21:30:28,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554859299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:28,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:28,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:30:28,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375942369] [2024-11-22 21:30:28,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:28,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:30:28,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:28,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:30:28,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:30:28,817 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-22 21:30:28,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 104 transitions, 1132 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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-11-22 21:30:28,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:28,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-22 21:30:28,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:29,527 INFO L124 PetriNetUnfolderBase]: 3675/5862 cut-off events. [2024-11-22 21:30:29,528 INFO L125 PetriNetUnfolderBase]: For 45759/45940 co-relation queries the response was YES. [2024-11-22 21:30:29,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26876 conditions, 5862 events. 3675/5862 cut-off events. For 45759/45940 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 34728 event pairs, 451 based on Foata normal form. 387/6221 useless extension candidates. Maximal degree in co-relation 26833. Up to 3131 conditions per place. [2024-11-22 21:30:29,564 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 100 selfloop transitions, 5 changer transitions 9/128 dead transitions. [2024-11-22 21:30:29,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 128 transitions, 1564 flow [2024-11-22 21:30:29,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:30:29,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:30:29,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2024-11-22 21:30:29,565 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6022727272727273 [2024-11-22 21:30:29,565 INFO L175 Difference]: Start difference. First operand has 102 places, 104 transitions, 1132 flow. Second operand 4 states and 106 transitions. [2024-11-22 21:30:29,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 128 transitions, 1564 flow [2024-11-22 21:30:29,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 128 transitions, 1256 flow, removed 87 selfloop flow, removed 19 redundant places. [2024-11-22 21:30:29,634 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 581 flow [2024-11-22 21:30:29,634 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=581, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2024-11-22 21:30:29,635 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 34 predicate places. [2024-11-22 21:30:29,635 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 581 flow [2024-11-22 21:30:29,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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-11-22 21:30:29,635 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:29,635 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:29,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 21:30:29,636 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:29,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:29,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1640179111, now seen corresponding path program 1 times [2024-11-22 21:30:29,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:29,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376538673] [2024-11-22 21:30:29,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:29,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:30,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:30,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376538673] [2024-11-22 21:30:30,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376538673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:30,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:30,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 21:30:30,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814781453] [2024-11-22 21:30:30,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:30,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 21:30:30,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:30,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 21:30:30,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 21:30:30,183 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-22 21:30:30,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 581 flow. Second operand has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:30,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:30,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-22 21:30:30,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:30,830 INFO L124 PetriNetUnfolderBase]: 2411/4259 cut-off events. [2024-11-22 21:30:30,830 INFO L125 PetriNetUnfolderBase]: For 14533/14873 co-relation queries the response was YES. [2024-11-22 21:30:30,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17750 conditions, 4259 events. 2411/4259 cut-off events. For 14533/14873 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 29129 event pairs, 679 based on Foata normal form. 98/4154 useless extension candidates. Maximal degree in co-relation 17717. Up to 2466 conditions per place. [2024-11-22 21:30:30,853 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 66 selfloop transitions, 11 changer transitions 31/126 dead transitions. [2024-11-22 21:30:30,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 126 transitions, 1139 flow [2024-11-22 21:30:30,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:30:30,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-22 21:30:30,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 231 transitions. [2024-11-22 21:30:30,855 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-11-22 21:30:30,855 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 581 flow. Second operand 10 states and 231 transitions. [2024-11-22 21:30:30,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 126 transitions, 1139 flow [2024-11-22 21:30:30,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 126 transitions, 1131 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-22 21:30:30,873 INFO L231 Difference]: Finished difference. Result has 97 places, 73 transitions, 617 flow [2024-11-22 21:30:30,873 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=617, PETRI_PLACES=97, PETRI_TRANSITIONS=73} [2024-11-22 21:30:30,874 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 48 predicate places. [2024-11-22 21:30:30,874 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 73 transitions, 617 flow [2024-11-22 21:30:30,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:30,874 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:30,874 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:30,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 21:30:30,875 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:30,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:30,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1599357543, now seen corresponding path program 1 times [2024-11-22 21:30:30,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:30,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332186478] [2024-11-22 21:30:30,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:30,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:32,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:32,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:32,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332186478] [2024-11-22 21:30:32,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332186478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:32,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:32,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 21:30:32,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587365606] [2024-11-22 21:30:32,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:32,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 21:30:32,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:32,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 21:30:32,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-22 21:30:32,428 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-22 21:30:32,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 73 transitions, 617 flow. Second operand has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:32,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:32,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-22 21:30:32,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:33,502 INFO L124 PetriNetUnfolderBase]: 2656/4732 cut-off events. [2024-11-22 21:30:33,502 INFO L125 PetriNetUnfolderBase]: For 20658/20971 co-relation queries the response was YES. [2024-11-22 21:30:33,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20981 conditions, 4732 events. 2656/4732 cut-off events. For 20658/20971 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 32684 event pairs, 913 based on Foata normal form. 177/4699 useless extension candidates. Maximal degree in co-relation 20941. Up to 2009 conditions per place. [2024-11-22 21:30:33,525 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 85 selfloop transitions, 19 changer transitions 57/179 dead transitions. [2024-11-22 21:30:33,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 179 transitions, 1765 flow [2024-11-22 21:30:33,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 21:30:33,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-22 21:30:33,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 316 transitions. [2024-11-22 21:30:33,527 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5524475524475524 [2024-11-22 21:30:33,527 INFO L175 Difference]: Start difference. First operand has 97 places, 73 transitions, 617 flow. Second operand 13 states and 316 transitions. [2024-11-22 21:30:33,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 179 transitions, 1765 flow [2024-11-22 21:30:33,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 179 transitions, 1652 flow, removed 36 selfloop flow, removed 13 redundant places. [2024-11-22 21:30:33,570 INFO L231 Difference]: Finished difference. Result has 101 places, 75 transitions, 668 flow [2024-11-22 21:30:33,570 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=668, PETRI_PLACES=101, PETRI_TRANSITIONS=75} [2024-11-22 21:30:33,571 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 52 predicate places. [2024-11-22 21:30:33,571 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 75 transitions, 668 flow [2024-11-22 21:30:33,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:33,571 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:33,571 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:33,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 21:30:33,571 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:33,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:33,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1119508951, now seen corresponding path program 2 times [2024-11-22 21:30:33,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:33,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412817017] [2024-11-22 21:30:33,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:30:33,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:33,599 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:30:33,599 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:30:34,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:34,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:34,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412817017] [2024-11-22 21:30:34,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412817017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:34,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:34,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 21:30:34,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351304434] [2024-11-22 21:30:34,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:34,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 21:30:34,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:34,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 21:30:34,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-22 21:30:34,387 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-22 21:30:34,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 75 transitions, 668 flow. Second operand has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:34,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:34,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-22 21:30:34,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:35,091 INFO L124 PetriNetUnfolderBase]: 2188/4016 cut-off events. [2024-11-22 21:30:35,091 INFO L125 PetriNetUnfolderBase]: For 17388/17648 co-relation queries the response was YES. [2024-11-22 21:30:35,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17914 conditions, 4016 events. 2188/4016 cut-off events. For 17388/17648 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 28006 event pairs, 1159 based on Foata normal form. 103/3913 useless extension candidates. Maximal degree in co-relation 17874. Up to 2908 conditions per place. [2024-11-22 21:30:35,114 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 61 selfloop transitions, 28 changer transitions 28/135 dead transitions. [2024-11-22 21:30:35,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 135 transitions, 1324 flow [2024-11-22 21:30:35,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 21:30:35,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-22 21:30:35,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 271 transitions. [2024-11-22 21:30:35,116 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5132575757575758 [2024-11-22 21:30:35,116 INFO L175 Difference]: Start difference. First operand has 101 places, 75 transitions, 668 flow. Second operand 12 states and 271 transitions. [2024-11-22 21:30:35,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 135 transitions, 1324 flow [2024-11-22 21:30:35,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 135 transitions, 1272 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-11-22 21:30:35,160 INFO L231 Difference]: Finished difference. Result has 109 places, 80 transitions, 808 flow [2024-11-22 21:30:35,160 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=808, PETRI_PLACES=109, PETRI_TRANSITIONS=80} [2024-11-22 21:30:35,161 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 60 predicate places. [2024-11-22 21:30:35,161 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 80 transitions, 808 flow [2024-11-22 21:30:35,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:35,161 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:35,162 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:35,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 21:30:35,162 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:35,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:35,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1779548841, now seen corresponding path program 3 times [2024-11-22 21:30:35,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:35,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042170458] [2024-11-22 21:30:35,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:30:35,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:35,208 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 21:30:35,208 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:30:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:36,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:36,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042170458] [2024-11-22 21:30:36,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042170458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:36,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:36,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 21:30:36,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020155358] [2024-11-22 21:30:36,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:36,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 21:30:36,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:36,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 21:30:36,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-22 21:30:36,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-22 21:30:36,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 80 transitions, 808 flow. Second operand has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:36,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:36,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-22 21:30:36,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:36,941 INFO L124 PetriNetUnfolderBase]: 2100/3889 cut-off events. [2024-11-22 21:30:36,941 INFO L125 PetriNetUnfolderBase]: For 24463/24737 co-relation queries the response was YES. [2024-11-22 21:30:37,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18856 conditions, 3889 events. 2100/3889 cut-off events. For 24463/24737 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 27321 event pairs, 1197 based on Foata normal form. 114/3800 useless extension candidates. Maximal degree in co-relation 18813. Up to 2791 conditions per place. [2024-11-22 21:30:37,017 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 60 selfloop transitions, 24 changer transitions 23/125 dead transitions. [2024-11-22 21:30:37,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 125 transitions, 1382 flow [2024-11-22 21:30:37,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:30:37,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-22 21:30:37,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 231 transitions. [2024-11-22 21:30:37,018 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-11-22 21:30:37,018 INFO L175 Difference]: Start difference. First operand has 109 places, 80 transitions, 808 flow. Second operand 10 states and 231 transitions. [2024-11-22 21:30:37,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 125 transitions, 1382 flow [2024-11-22 21:30:37,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 125 transitions, 1278 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-11-22 21:30:37,052 INFO L231 Difference]: Finished difference. Result has 112 places, 79 transitions, 768 flow [2024-11-22 21:30:37,052 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=768, PETRI_PLACES=112, PETRI_TRANSITIONS=79} [2024-11-22 21:30:37,053 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 63 predicate places. [2024-11-22 21:30:37,053 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 79 transitions, 768 flow [2024-11-22 21:30:37,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:37,053 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:37,053 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:37,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 21:30:37,053 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:37,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:37,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1145690199, now seen corresponding path program 4 times [2024-11-22 21:30:37,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:37,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252836004] [2024-11-22 21:30:37,054 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 21:30:37,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:37,075 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 21:30:37,075 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:30:37,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:37,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:37,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252836004] [2024-11-22 21:30:37,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252836004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:37,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:37,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:30:37,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159271333] [2024-11-22 21:30:37,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:37,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:30:37,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:37,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:30:37,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:30:37,216 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-22 21:30:37,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 79 transitions, 768 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:37,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:37,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-22 21:30:37,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:37,801 INFO L124 PetriNetUnfolderBase]: 2567/4229 cut-off events. [2024-11-22 21:30:37,801 INFO L125 PetriNetUnfolderBase]: For 37405/37556 co-relation queries the response was YES. [2024-11-22 21:30:37,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20402 conditions, 4229 events. 2567/4229 cut-off events. For 37405/37556 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 24489 event pairs, 272 based on Foata normal form. 345/4552 useless extension candidates. Maximal degree in co-relation 20357. Up to 1299 conditions per place. [2024-11-22 21:30:37,822 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 88 selfloop transitions, 8 changer transitions 16/125 dead transitions. [2024-11-22 21:30:37,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 125 transitions, 1491 flow [2024-11-22 21:30:37,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:30:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:30:37,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-11-22 21:30:37,823 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-11-22 21:30:37,823 INFO L175 Difference]: Start difference. First operand has 112 places, 79 transitions, 768 flow. Second operand 5 states and 135 transitions. [2024-11-22 21:30:37,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 125 transitions, 1491 flow [2024-11-22 21:30:37,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 125 transitions, 1343 flow, removed 46 selfloop flow, removed 10 redundant places. [2024-11-22 21:30:37,862 INFO L231 Difference]: Finished difference. Result has 103 places, 65 transitions, 553 flow [2024-11-22 21:30:37,862 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=553, PETRI_PLACES=103, PETRI_TRANSITIONS=65} [2024-11-22 21:30:37,863 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 54 predicate places. [2024-11-22 21:30:37,863 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 65 transitions, 553 flow [2024-11-22 21:30:37,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:37,863 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:37,864 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:37,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 21:30:37,864 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:37,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:37,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1478145826, now seen corresponding path program 1 times [2024-11-22 21:30:37,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:37,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015485125] [2024-11-22 21:30:37,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:37,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:39,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:39,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:39,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015485125] [2024-11-22 21:30:39,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015485125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:39,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:39,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 21:30:39,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110002818] [2024-11-22 21:30:39,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:39,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 21:30:39,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:39,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 21:30:39,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-22 21:30:39,044 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-22 21:30:39,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 65 transitions, 553 flow. Second operand has 12 states, 12 states have (on average 16.5) internal successors, (198), 12 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:39,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:39,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-22 21:30:39,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:39,615 INFO L124 PetriNetUnfolderBase]: 1245/2468 cut-off events. [2024-11-22 21:30:39,615 INFO L125 PetriNetUnfolderBase]: For 12047/12682 co-relation queries the response was YES. [2024-11-22 21:30:39,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10981 conditions, 2468 events. 1245/2468 cut-off events. For 12047/12682 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16450 event pairs, 556 based on Foata normal form. 80/2364 useless extension candidates. Maximal degree in co-relation 10939. Up to 1588 conditions per place. [2024-11-22 21:30:39,626 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 48 selfloop transitions, 14 changer transitions 23/107 dead transitions. [2024-11-22 21:30:39,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 107 transitions, 999 flow [2024-11-22 21:30:39,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 21:30:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-22 21:30:39,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 206 transitions. [2024-11-22 21:30:39,628 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5202020202020202 [2024-11-22 21:30:39,628 INFO L175 Difference]: Start difference. First operand has 103 places, 65 transitions, 553 flow. Second operand 9 states and 206 transitions. [2024-11-22 21:30:39,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 107 transitions, 999 flow [2024-11-22 21:30:39,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 107 transitions, 965 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-11-22 21:30:39,644 INFO L231 Difference]: Finished difference. Result has 105 places, 67 transitions, 628 flow [2024-11-22 21:30:39,644 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=628, PETRI_PLACES=105, PETRI_TRANSITIONS=67} [2024-11-22 21:30:39,644 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 56 predicate places. [2024-11-22 21:30:39,644 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 67 transitions, 628 flow [2024-11-22 21:30:39,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.5) internal successors, (198), 12 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:39,645 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:39,645 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:39,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 21:30:39,645 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:39,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:39,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1113732464, now seen corresponding path program 2 times [2024-11-22 21:30:39,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:39,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013117850] [2024-11-22 21:30:39,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:30:39,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:39,695 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:30:39,696 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:30:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:39,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:39,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013117850] [2024-11-22 21:30:39,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013117850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:39,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:39,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:30:39,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866347228] [2024-11-22 21:30:39,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:39,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:30:39,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:39,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:30:39,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:30:39,837 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-22 21:30:39,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 67 transitions, 628 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:39,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:39,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-22 21:30:39,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:40,241 INFO L124 PetriNetUnfolderBase]: 1728/2938 cut-off events. [2024-11-22 21:30:40,241 INFO L125 PetriNetUnfolderBase]: For 24794/24869 co-relation queries the response was YES. [2024-11-22 21:30:40,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14269 conditions, 2938 events. 1728/2938 cut-off events. For 24794/24869 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16983 event pairs, 256 based on Foata normal form. 143/3060 useless extension candidates. Maximal degree in co-relation 14227. Up to 1108 conditions per place. [2024-11-22 21:30:40,260 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 55 selfloop transitions, 11 changer transitions 32/109 dead transitions. [2024-11-22 21:30:40,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 109 transitions, 1229 flow [2024-11-22 21:30:40,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:30:40,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:30:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2024-11-22 21:30:40,262 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-11-22 21:30:40,262 INFO L175 Difference]: Start difference. First operand has 105 places, 67 transitions, 628 flow. Second operand 6 states and 144 transitions. [2024-11-22 21:30:40,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 109 transitions, 1229 flow [2024-11-22 21:30:40,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 109 transitions, 1051 flow, removed 64 selfloop flow, removed 12 redundant places. [2024-11-22 21:30:40,295 INFO L231 Difference]: Finished difference. Result has 96 places, 49 transitions, 346 flow [2024-11-22 21:30:40,295 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=346, PETRI_PLACES=96, PETRI_TRANSITIONS=49} [2024-11-22 21:30:40,295 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 47 predicate places. [2024-11-22 21:30:40,295 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 49 transitions, 346 flow [2024-11-22 21:30:40,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:40,296 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:40,296 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:40,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-22 21:30:40,297 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:40,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:40,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1987513671, now seen corresponding path program 1 times [2024-11-22 21:30:40,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:40,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222101883] [2024-11-22 21:30:40,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:40,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:42,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:42,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:30:42,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222101883] [2024-11-22 21:30:42,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222101883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:42,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:42,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-22 21:30:42,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179983038] [2024-11-22 21:30:42,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:42,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 21:30:42,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:30:42,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 21:30:42,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-22 21:30:42,830 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-22 21:30:42,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 49 transitions, 346 flow. Second operand has 13 states, 13 states have (on average 16.46153846153846) internal successors, (214), 13 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:42,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:42,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-22 21:30:42,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:43,290 INFO L124 PetriNetUnfolderBase]: 643/1272 cut-off events. [2024-11-22 21:30:43,291 INFO L125 PetriNetUnfolderBase]: For 5826/6064 co-relation queries the response was YES. [2024-11-22 21:30:43,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5103 conditions, 1272 events. 643/1272 cut-off events. For 5826/6064 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7341 event pairs, 168 based on Foata normal form. 28/1189 useless extension candidates. Maximal degree in co-relation 5068. Up to 496 conditions per place. [2024-11-22 21:30:43,296 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 31 selfloop transitions, 3 changer transitions 27/81 dead transitions. [2024-11-22 21:30:43,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 81 transitions, 638 flow [2024-11-22 21:30:43,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:30:43,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:30:43,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2024-11-22 21:30:43,297 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-22 21:30:43,297 INFO L175 Difference]: Start difference. First operand has 96 places, 49 transitions, 346 flow. Second operand 8 states and 176 transitions. [2024-11-22 21:30:43,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 81 transitions, 638 flow [2024-11-22 21:30:43,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 81 transitions, 491 flow, removed 53 selfloop flow, removed 20 redundant places. [2024-11-22 21:30:43,306 INFO L231 Difference]: Finished difference. Result has 75 places, 44 transitions, 229 flow [2024-11-22 21:30:43,306 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=229, PETRI_PLACES=75, PETRI_TRANSITIONS=44} [2024-11-22 21:30:43,307 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places. [2024-11-22 21:30:43,307 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 44 transitions, 229 flow [2024-11-22 21:30:43,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.46153846153846) internal successors, (214), 13 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:43,307 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:43,307 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:43,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-22 21:30:43,307 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:43,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:43,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1558540633, now seen corresponding path program 2 times [2024-11-22 21:30:43,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:30:43,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57490736] [2024-11-22 21:30:43,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:30:43,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:30:43,379 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:30:43,379 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 21:30:43,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:30:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:30:43,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 21:30:43,502 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:30:43,503 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-22 21:30:43,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-22 21:30:43,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-22 21:30:43,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-22 21:30:43,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-22 21:30:43,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-22 21:30:43,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-22 21:30:43,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-22 21:30:43,506 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:43,594 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 21:30:43,595 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 21:30:43,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:30:43 BasicIcfg [2024-11-22 21:30:43,599 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 21:30:43,600 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 21:30:43,600 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 21:30:43,600 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 21:30:43,600 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:30:08" (3/4) ... [2024-11-22 21:30:43,602 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 21:30:43,603 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 21:30:43,604 INFO L158 Benchmark]: Toolchain (without parser) took 36817.29ms. Allocated memory was 169.9MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 100.1MB in the beginning and 661.1MB in the end (delta: -561.0MB). Peak memory consumption was 850.4MB. Max. memory is 16.1GB. [2024-11-22 21:30:43,604 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 169.9MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:30:43,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 665.95ms. Allocated memory is still 169.9MB. Free memory was 100.0MB in the beginning and 117.4MB in the end (delta: -17.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 21:30:43,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.94ms. Allocated memory is still 169.9MB. Free memory was 117.4MB in the beginning and 114.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:30:43,604 INFO L158 Benchmark]: Boogie Preprocessor took 79.45ms. Allocated memory is still 169.9MB. Free memory was 114.0MB in the beginning and 109.0MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 21:30:43,605 INFO L158 Benchmark]: RCFGBuilder took 899.67ms. Allocated memory is still 169.9MB. Free memory was 109.0MB in the beginning and 123.9MB in the end (delta: -14.9MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2024-11-22 21:30:43,605 INFO L158 Benchmark]: TraceAbstraction took 35088.12ms. Allocated memory was 169.9MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 122.9MB in the beginning and 662.2MB in the end (delta: -539.3MB). Peak memory consumption was 869.9MB. Max. memory is 16.1GB. [2024-11-22 21:30:43,605 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 1.6GB. Free memory was 662.2MB in the beginning and 661.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:30:43,607 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.18ms. Allocated memory is still 169.9MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 665.95ms. Allocated memory is still 169.9MB. Free memory was 100.0MB in the beginning and 117.4MB in the end (delta: -17.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.94ms. Allocated memory is still 169.9MB. Free memory was 117.4MB in the beginning and 114.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.45ms. Allocated memory is still 169.9MB. Free memory was 114.0MB in the beginning and 109.0MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 899.67ms. Allocated memory is still 169.9MB. Free memory was 109.0MB in the beginning and 123.9MB in the end (delta: -14.9MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. * TraceAbstraction took 35088.12ms. Allocated memory was 169.9MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 122.9MB in the beginning and 662.2MB in the end (delta: -539.3MB). Peak memory consumption was 869.9MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 1.6GB. Free memory was 662.2MB in the beginning and 661.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1873; [L845] FCALL, FORK 0 pthread_create(&t1873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L846] 0 pthread_t t1874; [L847] FCALL, FORK 0 pthread_create(&t1874, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=-2, t1874=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L848] 0 pthread_t t1875; [L849] FCALL, FORK 0 pthread_create(&t1875, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L770] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] 3 y$mem_tmp = y [L810] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EBX = y [L818] 3 y = y$flush_delayed ? y$mem_tmp : y [L819] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 y$flush_delayed = weak$$choice2 [L865] 0 y$mem_tmp = y [L866] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L867] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L868] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L869] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L870] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L872] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L874] 0 y = y$flush_delayed ? y$mem_tmp : y [L875] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L877] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "safe004_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: 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: 849]: 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: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 34.9s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 18.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1303 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1270 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 194 mSDsCounter, 255 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4526 IncrementalHoareTripleChecker+Invalid, 4781 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 255 mSolverCounterUnsat, 50 mSDtfsCounter, 4526 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 230 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1132occurred in iteration=13, InterpolantAutomatonStates: 180, 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.7s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 503 NumberOfCodeBlocks, 503 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 451 ConstructedInterpolants, 0 QuantifiedInterpolants, 5196 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 21:30:43,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:30:45,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:30:46,041 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 21:30:46,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:30:46,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:30:46,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:30:46,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:30:46,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:30:46,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:30:46,081 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:30:46,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:30:46,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:30:46,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:30:46,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:30:46,083 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:30:46,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:30:46,084 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:30:46,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:30:46,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:30:46,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:30:46,086 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:30:46,086 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:30:46,086 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:30:46,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:30:46,087 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:30:46,087 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 21:30:46,088 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:30:46,088 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 21:30:46,088 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:30:46,089 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:30:46,089 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:30:46,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:30:46,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:30:46,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:30:46,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:30:46,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:30:46,091 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:30:46,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:30:46,092 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 21:30:46,092 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 21:30:46,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:30:46,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:30:46,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:30:46,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:30:46,096 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 [2024-11-22 21:30:46,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:30:46,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:30:46,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:30:46,416 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:30:46,417 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:30:46,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-11-22 21:30:47,999 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:30:48,296 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:30:48,299 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-11-22 21:30:48,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59249ddc0/5e5d9aeefd8c41b29f765ce717a1737d/FLAG90f2bc5a0 [2024-11-22 21:30:48,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59249ddc0/5e5d9aeefd8c41b29f765ce717a1737d [2024-11-22 21:30:48,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:30:48,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:30:48,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:30:48,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:30:48,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:30:48,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:30:48" (1/1) ... [2024-11-22 21:30:48,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6526c003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:48, skipping insertion in model container [2024-11-22 21:30:48,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:30:48" (1/1) ... [2024-11-22 21:30:48,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:30:48,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:30:48,847 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:30:48,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:30:48,986 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:30:48,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:48 WrapperNode [2024-11-22 21:30:48,987 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:30:48,988 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:30:48,988 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:30:48,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:30:48,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:48" (1/1) ... [2024-11-22 21:30:49,022 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:48" (1/1) ... [2024-11-22 21:30:49,053 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-11-22 21:30:49,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:30:49,058 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:30:49,058 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:30:49,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:30:49,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:48" (1/1) ... [2024-11-22 21:30:49,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:48" (1/1) ... [2024-11-22 21:30:49,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:48" (1/1) ... [2024-11-22 21:30:49,114 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 21:30:49,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:48" (1/1) ... [2024-11-22 21:30:49,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:48" (1/1) ... [2024-11-22 21:30:49,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:48" (1/1) ... [2024-11-22 21:30:49,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:48" (1/1) ... [2024-11-22 21:30:49,131 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:48" (1/1) ... [2024-11-22 21:30:49,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:48" (1/1) ... [2024-11-22 21:30:49,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:30:49,137 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:30:49,137 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:30:49,138 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:30:49,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:48" (1/1) ... [2024-11-22 21:30:49,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:30:49,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:30:49,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 21:30:49,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 21:30:49,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 21:30:49,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:30:49,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 21:30:49,232 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-22 21:30:49,233 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-22 21:30:49,233 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-22 21:30:49,233 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-22 21:30:49,233 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-22 21:30:49,233 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-22 21:30:49,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 21:30:49,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:30:49,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:30:49,236 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:30:49,400 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:30:49,402 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:30:49,826 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:30:49,827 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:30:50,127 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:30:50,127 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 21:30:50,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:30:50 BoogieIcfgContainer [2024-11-22 21:30:50,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:30:50,130 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:30:50,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:30:50,133 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:30:50,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:30:48" (1/3) ... [2024-11-22 21:30:50,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54be55d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:30:50, skipping insertion in model container [2024-11-22 21:30:50,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:48" (2/3) ... [2024-11-22 21:30:50,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54be55d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:30:50, skipping insertion in model container [2024-11-22 21:30:50,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:30:50" (3/3) ... [2024-11-22 21:30:50,136 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-11-22 21:30:50,157 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:30:50,157 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-22 21:30:50,157 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:30:50,228 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:30:50,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-22 21:30:50,293 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-22 21:30:50,294 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:30:50,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-11-22 21:30:50,298 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-22 21:30:50,301 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-22 21:30:50,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:30:50,323 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;@7fe6e5af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:30:50,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-22 21:30:50,328 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:30:50,328 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-22 21:30:50,328 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:30:50,328 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:50,329 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-22 21:30:50,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:50,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:50,334 INFO L85 PathProgramCache]: Analyzing trace with hash 14280030, now seen corresponding path program 1 times [2024-11-22 21:30:50,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:30:50,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554973456] [2024-11-22 21:30:50,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:50,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:30:50,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:30:50,351 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:30:50,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 21:30:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:50,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:30:50,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:30:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:50,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:30:50,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:30:50,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554973456] [2024-11-22 21:30:50,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554973456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:50,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:50,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:30:50,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344926490] [2024-11-22 21:30:50,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:50,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:30:50,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:30:50,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:30:50,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:30:50,545 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-22 21:30:50,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:50,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:50,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-22 21:30:50,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:51,127 INFO L124 PetriNetUnfolderBase]: 1178/2120 cut-off events. [2024-11-22 21:30:51,128 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-22 21:30:51,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3910 conditions, 2120 events. 1178/2120 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14211 event pairs, 188 based on Foata normal form. 120/2232 useless extension candidates. Maximal degree in co-relation 3899. Up to 1420 conditions per place. [2024-11-22 21:30:51,148 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 37 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2024-11-22 21:30:51,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 207 flow [2024-11-22 21:30:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:30:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:30:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-22 21:30:51,160 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7348484848484849 [2024-11-22 21:30:51,162 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 97 transitions. [2024-11-22 21:30:51,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 207 flow [2024-11-22 21:30:51,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 202 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:30:51,170 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-22 21:30:51,173 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-22 21:30:51,177 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-22 21:30:51,177 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-22 21:30:51,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:51,177 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:51,177 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:51,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 21:30:51,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:30:51,381 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:51,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:51,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1140311638, now seen corresponding path program 1 times [2024-11-22 21:30:51,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:30:51,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292756181] [2024-11-22 21:30:51,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:51,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:30:51,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:30:51,387 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:30:51,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 21:30:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:51,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:30:51,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:30:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:51,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:30:51,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:30:51,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292756181] [2024-11-22 21:30:51,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292756181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:51,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:51,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:30:51,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814151946] [2024-11-22 21:30:51,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:51,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:30:51,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:30:51,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:30:51,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:30:51,551 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-22 21:30:51,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:51,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:51,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-22 21:30:51,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:52,176 INFO L124 PetriNetUnfolderBase]: 2211/3695 cut-off events. [2024-11-22 21:30:52,176 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2024-11-22 21:30:52,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7239 conditions, 3695 events. 2211/3695 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 23213 event pairs, 227 based on Foata normal form. 120/3805 useless extension candidates. Maximal degree in co-relation 7229. Up to 2171 conditions per place. [2024-11-22 21:30:52,197 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 47 selfloop transitions, 5 changer transitions 1/63 dead transitions. [2024-11-22 21:30:52,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 250 flow [2024-11-22 21:30:52,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:30:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:30:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2024-11-22 21:30:52,201 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6079545454545454 [2024-11-22 21:30:52,201 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 4 states and 107 transitions. [2024-11-22 21:30:52,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 250 flow [2024-11-22 21:30:52,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:30:52,206 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 112 flow [2024-11-22 21:30:52,206 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2024-11-22 21:30:52,207 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-11-22 21:30:52,207 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 112 flow [2024-11-22 21:30:52,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:52,208 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:52,209 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:52,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-22 21:30:52,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:30:52,410 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:52,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:52,411 INFO L85 PathProgramCache]: Analyzing trace with hash -634179217, now seen corresponding path program 1 times [2024-11-22 21:30:52,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:30:52,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948895275] [2024-11-22 21:30:52,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:52,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:30:52,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:30:52,413 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:30:52,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 21:30:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:52,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 21:30:52,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:30:52,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:52,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:30:52,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:30:52,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948895275] [2024-11-22 21:30:52,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948895275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:52,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:52,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:30:52,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53143730] [2024-11-22 21:30:52,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:52,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:30:52,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:30:52,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:30:52,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:30:52,562 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-22 21:30:52,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:52,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:52,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-22 21:30:52,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:53,053 INFO L124 PetriNetUnfolderBase]: 1281/2169 cut-off events. [2024-11-22 21:30:53,053 INFO L125 PetriNetUnfolderBase]: For 484/484 co-relation queries the response was YES. [2024-11-22 21:30:53,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4847 conditions, 2169 events. 1281/2169 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 11847 event pairs, 125 based on Foata normal form. 96/2255 useless extension candidates. Maximal degree in co-relation 4835. Up to 897 conditions per place. [2024-11-22 21:30:53,069 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 59 selfloop transitions, 8 changer transitions 1/78 dead transitions. [2024-11-22 21:30:53,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 78 transitions, 347 flow [2024-11-22 21:30:53,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:30:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:30:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-11-22 21:30:53,071 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-11-22 21:30:53,072 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 112 flow. Second operand 5 states and 135 transitions. [2024-11-22 21:30:53,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 78 transitions, 347 flow [2024-11-22 21:30:53,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 78 transitions, 337 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-22 21:30:53,075 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 152 flow [2024-11-22 21:30:53,075 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2024-11-22 21:30:53,076 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2024-11-22 21:30:53,076 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 152 flow [2024-11-22 21:30:53,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:53,077 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:53,077 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:53,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-22 21:30:53,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:30:53,278 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:53,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:53,279 INFO L85 PathProgramCache]: Analyzing trace with hash -632800297, now seen corresponding path program 1 times [2024-11-22 21:30:53,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:30:53,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153470817] [2024-11-22 21:30:53,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:53,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:30:53,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:30:53,283 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:30:53,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 21:30:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:53,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:30:53,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:30:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:53,449 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:30:53,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:30:53,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153470817] [2024-11-22 21:30:53,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153470817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:53,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:53,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:30:53,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250287145] [2024-11-22 21:30:53,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:53,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:30:53,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:30:53,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:30:53,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:30:53,469 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-22 21:30:53,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:53,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:53,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-22 21:30:53,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:53,835 INFO L124 PetriNetUnfolderBase]: 683/1123 cut-off events. [2024-11-22 21:30:53,835 INFO L125 PetriNetUnfolderBase]: For 856/856 co-relation queries the response was YES. [2024-11-22 21:30:53,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2873 conditions, 1123 events. 683/1123 cut-off events. For 856/856 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5130 event pairs, 105 based on Foata normal form. 44/1157 useless extension candidates. Maximal degree in co-relation 2859. Up to 352 conditions per place. [2024-11-22 21:30:53,842 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 51 selfloop transitions, 11 changer transitions 1/73 dead transitions. [2024-11-22 21:30:53,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 73 transitions, 350 flow [2024-11-22 21:30:53,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:30:53,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:30:53,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-11-22 21:30:53,844 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-11-22 21:30:53,844 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 152 flow. Second operand 6 states and 143 transitions. [2024-11-22 21:30:53,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 73 transitions, 350 flow [2024-11-22 21:30:53,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 325 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-22 21:30:53,851 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 166 flow [2024-11-22 21:30:53,851 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-11-22 21:30:53,852 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-11-22 21:30:53,852 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 166 flow [2024-11-22 21:30:53,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:53,852 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:53,852 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:53,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-22 21:30:54,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:30:54,056 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:54,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:54,057 INFO L85 PathProgramCache]: Analyzing trace with hash -811564713, now seen corresponding path program 1 times [2024-11-22 21:30:54,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:30:54,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439845272] [2024-11-22 21:30:54,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:54,058 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:30:54,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:30:54,059 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:30:54,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 21:30:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:54,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 21:30:54,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:30:54,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:54,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:30:54,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:30:54,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439845272] [2024-11-22 21:30:54,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439845272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:54,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:54,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:30:54,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994044091] [2024-11-22 21:30:54,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:54,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:30:54,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:30:54,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:30:54,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:30:54,232 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-22 21:30:54,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:54,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:54,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-22 21:30:54,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:54,342 INFO L124 PetriNetUnfolderBase]: 368/696 cut-off events. [2024-11-22 21:30:54,343 INFO L125 PetriNetUnfolderBase]: For 259/269 co-relation queries the response was YES. [2024-11-22 21:30:54,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 696 events. 368/696 cut-off events. For 259/269 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3402 event pairs, 349 based on Foata normal form. 8/674 useless extension candidates. Maximal degree in co-relation 1553. Up to 576 conditions per place. [2024-11-22 21:30:54,348 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 20 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-11-22 21:30:54,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 208 flow [2024-11-22 21:30:54,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:30:54,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:30:54,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-22 21:30:54,349 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2024-11-22 21:30:54,349 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 166 flow. Second operand 3 states and 71 transitions. [2024-11-22 21:30:54,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 208 flow [2024-11-22 21:30:54,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 41 transitions, 152 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-22 21:30:54,352 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 108 flow [2024-11-22 21:30:54,352 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2024-11-22 21:30:54,353 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-11-22 21:30:54,353 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 108 flow [2024-11-22 21:30:54,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:54,353 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:54,354 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:54,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 21:30:54,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:30:54,555 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:54,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:54,555 INFO L85 PathProgramCache]: Analyzing trace with hash -484381667, now seen corresponding path program 1 times [2024-11-22 21:30:54,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:30:54,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556391998] [2024-11-22 21:30:54,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:30:54,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:30:54,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:30:54,558 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:30:54,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 21:30:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:30:54,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-22 21:30:54,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:30:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:55,914 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:30:55,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:30:55,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556391998] [2024-11-22 21:30:55,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556391998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:55,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:55,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 21:30:55,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958406505] [2024-11-22 21:30:55,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:55,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 21:30:55,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:30:55,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 21:30:55,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-22 21:30:55,941 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-22 21:30:55,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 108 flow. Second operand has 12 states, 12 states have (on average 17.583333333333332) internal successors, (211), 12 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:55,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:55,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-22 21:30:55,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:56,757 INFO L124 PetriNetUnfolderBase]: 905/1686 cut-off events. [2024-11-22 21:30:56,757 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:30:56,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3327 conditions, 1686 events. 905/1686 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9682 event pairs, 243 based on Foata normal form. 16/1649 useless extension candidates. Maximal degree in co-relation 3320. Up to 468 conditions per place. [2024-11-22 21:30:56,766 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 50 selfloop transitions, 8 changer transitions 22/98 dead transitions. [2024-11-22 21:30:56,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 98 transitions, 390 flow [2024-11-22 21:30:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 21:30:56,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-22 21:30:56,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 258 transitions. [2024-11-22 21:30:56,767 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5330578512396694 [2024-11-22 21:30:56,768 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 108 flow. Second operand 11 states and 258 transitions. [2024-11-22 21:30:56,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 98 transitions, 390 flow [2024-11-22 21:30:56,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 98 transitions, 389 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:30:56,770 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 159 flow [2024-11-22 21:30:56,770 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=159, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2024-11-22 21:30:56,771 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2024-11-22 21:30:56,771 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 159 flow [2024-11-22 21:30:56,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 17.583333333333332) internal successors, (211), 12 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:56,771 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:56,772 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:56,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-22 21:30:56,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:30:56,976 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:56,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:56,976 INFO L85 PathProgramCache]: Analyzing trace with hash -322620757, now seen corresponding path program 2 times [2024-11-22 21:30:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:30:56,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826683753] [2024-11-22 21:30:56,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:30:56,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:30:56,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:30:56,980 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:30:56,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-22 21:30:57,087 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:30:57,088 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:30:57,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:30:57,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:30:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:30:57,149 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:30:57,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:30:57,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826683753] [2024-11-22 21:30:57,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826683753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:30:57,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:30:57,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:30:57,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420638017] [2024-11-22 21:30:57,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:30:57,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:30:57,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:30:57,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:30:57,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:30:57,158 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-22 21:30:57,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:57,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:30:57,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-22 21:30:57,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:30:57,589 INFO L124 PetriNetUnfolderBase]: 1704/3036 cut-off events. [2024-11-22 21:30:57,589 INFO L125 PetriNetUnfolderBase]: For 578/580 co-relation queries the response was YES. [2024-11-22 21:30:57,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6686 conditions, 3036 events. 1704/3036 cut-off events. For 578/580 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 19731 event pairs, 892 based on Foata normal form. 9/2903 useless extension candidates. Maximal degree in co-relation 6671. Up to 1357 conditions per place. [2024-11-22 21:30:57,605 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 30 selfloop transitions, 2 changer transitions 21/70 dead transitions. [2024-11-22 21:30:57,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 334 flow [2024-11-22 21:30:57,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:30:57,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:30:57,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-11-22 21:30:57,606 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5590909090909091 [2024-11-22 21:30:57,606 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 159 flow. Second operand 5 states and 123 transitions. [2024-11-22 21:30:57,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 70 transitions, 334 flow [2024-11-22 21:30:57,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 70 transitions, 321 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-11-22 21:30:57,610 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 135 flow [2024-11-22 21:30:57,610 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2024-11-22 21:30:57,611 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2024-11-22 21:30:57,611 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 135 flow [2024-11-22 21:30:57,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:30:57,611 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:30:57,611 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:30:57,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-22 21:30:57,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:30:57,812 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:30:57,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:30:57,813 INFO L85 PathProgramCache]: Analyzing trace with hash -285661943, now seen corresponding path program 3 times [2024-11-22 21:30:57,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:30:57,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615042449] [2024-11-22 21:30:57,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:30:57,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:30:57,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:30:57,817 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:30:57,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 21:30:57,929 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 21:30:57,930 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 21:30:57,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:30:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:30:58,079 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-22 21:30:58,079 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:30:58,080 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-22 21:30:58,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-22 21:30:58,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-22 21:30:58,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-22 21:30:58,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-22 21:30:58,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-22 21:30:58,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-22 21:30:58,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-22 21:30:58,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:30:58,284 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2024-11-22 21:30:58,368 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 21:30:58,368 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 21:30:58,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:30:58 BasicIcfg [2024-11-22 21:30:58,372 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 21:30:58,373 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 21:30:58,373 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 21:30:58,373 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 21:30:58,373 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:30:50" (3/4) ... [2024-11-22 21:30:58,375 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 21:30:58,377 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 21:30:58,378 INFO L158 Benchmark]: Toolchain (without parser) took 10037.13ms. Allocated memory was 54.5MB in the beginning and 578.8MB in the end (delta: 524.3MB). Free memory was 30.3MB in the beginning and 308.6MB in the end (delta: -278.4MB). Peak memory consumption was 246.6MB. Max. memory is 16.1GB. [2024-11-22 21:30:58,379 INFO L158 Benchmark]: CDTParser took 1.03ms. Allocated memory is still 44.0MB. Free memory was 23.1MB in the beginning and 23.1MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:30:58,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 644.59ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 30.1MB in the beginning and 41.1MB in the end (delta: -11.0MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-11-22 21:30:58,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.90ms. Allocated memory is still 67.1MB. Free memory was 41.1MB in the beginning and 38.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:30:58,380 INFO L158 Benchmark]: Boogie Preprocessor took 78.40ms. Allocated memory is still 67.1MB. Free memory was 38.2MB in the beginning and 34.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 21:30:58,380 INFO L158 Benchmark]: RCFGBuilder took 990.41ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 34.0MB in the beginning and 39.2MB in the end (delta: -5.3MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2024-11-22 21:30:58,381 INFO L158 Benchmark]: TraceAbstraction took 8242.79ms. Allocated memory was 88.1MB in the beginning and 578.8MB in the end (delta: 490.7MB). Free memory was 38.8MB in the beginning and 308.6MB in the end (delta: -269.8MB). Peak memory consumption was 222.0MB. Max. memory is 16.1GB. [2024-11-22 21:30:58,381 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 578.8MB. Free memory is still 308.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:30:58,386 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.03ms. Allocated memory is still 44.0MB. Free memory was 23.1MB in the beginning and 23.1MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 644.59ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 30.1MB in the beginning and 41.1MB in the end (delta: -11.0MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.90ms. Allocated memory is still 67.1MB. Free memory was 41.1MB in the beginning and 38.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.40ms. Allocated memory is still 67.1MB. Free memory was 38.2MB in the beginning and 34.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 990.41ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 34.0MB in the beginning and 39.2MB in the end (delta: -5.3MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8242.79ms. Allocated memory was 88.1MB in the beginning and 578.8MB in the end (delta: 490.7MB). Free memory was 38.8MB in the beginning and 308.6MB in the end (delta: -269.8MB). Peak memory consumption was 222.0MB. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 578.8MB. Free memory is still 308.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1873; [L845] FCALL, FORK 0 pthread_create(&t1873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L846] 0 pthread_t t1874; [L847] FCALL, FORK 0 pthread_create(&t1874, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=0, t1874=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L848] 0 pthread_t t1875; [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L770] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L849] FCALL, FORK 0 pthread_create(&t1875, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1873=0, t1874=1, t1875=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] 3 y$mem_tmp = y [L810] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EBX = y [L818] 3 y = y$flush_delayed ? y$mem_tmp : y [L819] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=0, t1874=1, t1875=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=0, t1874=1, t1875=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 y$flush_delayed = weak$$choice2 [L865] 0 y$mem_tmp = y [L866] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L867] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L868] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L869] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L870] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L872] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L874] 0 y = y$flush_delayed ? y$mem_tmp : y [L875] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=0, t1874=1, t1875=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L877] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "safe004_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: 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: 849]: 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: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 308 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 296 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 987 IncrementalHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 4 mSDtfsCounter, 987 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=4, InterpolantAutomatonStates: 37, 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.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 857 SizeOfPredicates, 15 NumberOfNonLiveVariables, 841 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 21:30:58,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample