./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/stack_longest-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/stack_longest-1.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 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:20:15,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:20:15,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:20:15,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:20:15,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:20:15,399 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:20:15,399 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:20:15,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:20:15,401 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:20:15,402 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:20:15,402 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:20:15,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:20:15,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:20:15,405 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:20:15,406 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:20:15,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:20:15,406 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:20:15,407 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:20:15,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:20:15,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:20:15,408 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:20:15,411 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:20:15,412 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:20:15,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:20:15,412 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:20:15,412 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:20:15,412 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:20:15,413 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:20:15,413 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:20:15,413 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:20:15,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:20:15,414 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:20:15,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:20:15,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:20:15,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:20:15,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:20:15,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:20:15,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:20:15,417 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:20:15,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:20:15,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:20:15,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:20:15,419 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 -> 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 [2024-11-19 09:20:15,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:20:15,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:20:15,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:20:15,718 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:20:15,718 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:20:15,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longest-1.i [2024-11-19 09:20:17,224 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:20:17,500 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:20:17,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-1.i [2024-11-19 09:20:17,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90983f405/c39bdc4db6f342e6a71ae247c044a6f4/FLAG06201f889 [2024-11-19 09:20:17,542 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90983f405/c39bdc4db6f342e6a71ae247c044a6f4 [2024-11-19 09:20:17,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:20:17,546 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:20:17,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:20:17,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:20:17,555 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:20:17,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:20:17" (1/1) ... [2024-11-19 09:20:17,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62499cfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:17, skipping insertion in model container [2024-11-19 09:20:17,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:20:17" (1/1) ... [2024-11-19 09:20:17,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:20:18,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:20:18,110 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:20:18,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:20:18,313 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:20:18,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:18 WrapperNode [2024-11-19 09:20:18,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:20:18,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:20:18,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:20:18,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:20:18,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:18" (1/1) ... [2024-11-19 09:20:18,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:18" (1/1) ... [2024-11-19 09:20:18,452 INFO L138 Inliner]: procedures = 277, calls = 832, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 956 [2024-11-19 09:20:18,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:20:18,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:20:18,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:20:18,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:20:18,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:18" (1/1) ... [2024-11-19 09:20:18,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:18" (1/1) ... [2024-11-19 09:20:18,478 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:18" (1/1) ... [2024-11-19 09:20:18,527 INFO L175 MemorySlicer]: Split 809 memory accesses to 3 slices as follows [2, 5, 802]. 99 percent of accesses are in the largest equivalence class. The 807 initializations are split as follows [2, 5, 800]. The 1 writes are split as follows [0, 0, 1]. [2024-11-19 09:20:18,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:18" (1/1) ... [2024-11-19 09:20:18,532 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:18" (1/1) ... [2024-11-19 09:20:18,569 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:18" (1/1) ... [2024-11-19 09:20:18,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:18" (1/1) ... [2024-11-19 09:20:18,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:18" (1/1) ... [2024-11-19 09:20:18,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:18" (1/1) ... [2024-11-19 09:20:18,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:20:18,605 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:20:18,605 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:20:18,605 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:20:18,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:18" (1/1) ... [2024-11-19 09:20:18,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:20:18,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:20:18,643 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-19 09:20:18,648 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-19 09:20:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-19 09:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-19 09:20:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-19 09:20:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-19 09:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 09:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 09:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 09:20:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 09:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 09:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 09:20:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 09:20:18,702 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 09:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 09:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 09:20:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:20:18,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:20:18,706 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:20:18,849 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:20:18,851 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:20:20,052 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:20:20,053 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:20:34,123 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:20:34,124 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 09:20:34,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:20:34 BoogieIcfgContainer [2024-11-19 09:20:34,124 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:20:34,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:20:34,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:20:34,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:20:34,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:20:17" (1/3) ... [2024-11-19 09:20:34,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57949dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:20:34, skipping insertion in model container [2024-11-19 09:20:34,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:18" (2/3) ... [2024-11-19 09:20:34,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57949dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:20:34, skipping insertion in model container [2024-11-19 09:20:34,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:20:34" (3/3) ... [2024-11-19 09:20:34,137 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-1.i [2024-11-19 09:20:34,164 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:20:34,165 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-19 09:20:34,165 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:20:34,238 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 09:20:34,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 124 flow [2024-11-19 09:20:34,331 INFO L124 PetriNetUnfolderBase]: 9/53 cut-off events. [2024-11-19 09:20:34,332 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:20:34,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 53 events. 9/53 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 135 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 48. Up to 3 conditions per place. [2024-11-19 09:20:34,337 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 55 transitions, 124 flow [2024-11-19 09:20:34,340 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 52 transitions, 116 flow [2024-11-19 09:20:34,352 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:20:34,361 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;@57a36db4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:20:34,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-19 09:20:34,390 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:20:34,391 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2024-11-19 09:20:34,391 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:20:34,391 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:34,392 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:34,392 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:20:34,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:34,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1668128280, now seen corresponding path program 1 times [2024-11-19 09:20:34,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:34,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637314052] [2024-11-19 09:20:34,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:34,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:35,417 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-19 09:20:35,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:35,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637314052] [2024-11-19 09:20:35,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637314052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:35,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:35,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:20:35,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075761969] [2024-11-19 09:20:35,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:35,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:20:35,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:35,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:20:35,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:20:35,489 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-19 09:20:35,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-19 09:20:35,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:35,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-19 09:20:35,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:35,846 INFO L124 PetriNetUnfolderBase]: 459/880 cut-off events. [2024-11-19 09:20:35,846 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-19 09:20:35,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1652 conditions, 880 events. 459/880 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4527 event pairs, 245 based on Foata normal form. 94/846 useless extension candidates. Maximal degree in co-relation 1574. Up to 520 conditions per place. [2024-11-19 09:20:35,858 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 43 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2024-11-19 09:20:35,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 227 flow [2024-11-19 09:20:35,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:20:35,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:20:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-11-19 09:20:35,871 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2024-11-19 09:20:35,873 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 116 flow. Second operand 4 states and 117 transitions. [2024-11-19 09:20:35,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 227 flow [2024-11-19 09:20:35,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 217 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:20:35,881 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 100 flow [2024-11-19 09:20:35,883 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2024-11-19 09:20:35,887 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2024-11-19 09:20:35,887 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 100 flow [2024-11-19 09:20:35,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-19 09:20:35,888 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:35,888 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:35,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:20:35,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:20:35,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:35,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1668128281, now seen corresponding path program 1 times [2024-11-19 09:20:35,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:35,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157338944] [2024-11-19 09:20:35,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:35,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:36,750 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-19 09:20:36,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:36,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157338944] [2024-11-19 09:20:36,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157338944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:36,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:36,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:20:36,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670379902] [2024-11-19 09:20:36,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:36,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:20:36,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:36,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:20:36,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:20:36,776 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-19 09:20:36,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:20:36,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:36,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-19 09:20:36,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:37,215 INFO L124 PetriNetUnfolderBase]: 755/1387 cut-off events. [2024-11-19 09:20:37,216 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-11-19 09:20:37,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2685 conditions, 1387 events. 755/1387 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7466 event pairs, 125 based on Foata normal form. 0/1207 useless extension candidates. Maximal degree in co-relation 810. Up to 848 conditions per place. [2024-11-19 09:20:37,227 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 87 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2024-11-19 09:20:37,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 423 flow [2024-11-19 09:20:37,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:20:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:20:37,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2024-11-19 09:20:37,230 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2024-11-19 09:20:37,230 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 100 flow. Second operand 6 states and 194 transitions. [2024-11-19 09:20:37,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 423 flow [2024-11-19 09:20:37,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 108 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:20:37,234 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 153 flow [2024-11-19 09:20:37,235 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2024-11-19 09:20:37,236 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-11-19 09:20:37,236 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 153 flow [2024-11-19 09:20:37,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:20:37,236 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:37,236 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:37,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:20:37,237 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:20:37,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:37,238 INFO L85 PathProgramCache]: Analyzing trace with hash 491241438, now seen corresponding path program 1 times [2024-11-19 09:20:37,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:37,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252428170] [2024-11-19 09:20:37,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:37,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:37,538 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-19 09:20:37,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:37,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252428170] [2024-11-19 09:20:37,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252428170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:37,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:37,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:20:37,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054326637] [2024-11-19 09:20:37,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:37,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:20:37,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:37,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:20:37,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:20:37,546 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-19 09:20:37,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-19 09:20:37,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:37,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-19 09:20:37,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:37,827 INFO L124 PetriNetUnfolderBase]: 668/1270 cut-off events. [2024-11-19 09:20:37,829 INFO L125 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2024-11-19 09:20:37,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2683 conditions, 1270 events. 668/1270 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6582 event pairs, 181 based on Foata normal form. 34/1183 useless extension candidates. Maximal degree in co-relation 2598. Up to 721 conditions per place. [2024-11-19 09:20:37,839 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 67 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2024-11-19 09:20:37,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 87 transitions, 376 flow [2024-11-19 09:20:37,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:20:37,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:20:37,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2024-11-19 09:20:37,841 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2024-11-19 09:20:37,842 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 153 flow. Second operand 5 states and 160 transitions. [2024-11-19 09:20:37,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 87 transitions, 376 flow [2024-11-19 09:20:37,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 87 transitions, 374 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-19 09:20:37,846 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 161 flow [2024-11-19 09:20:37,847 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2024-11-19 09:20:37,847 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2024-11-19 09:20:37,848 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 161 flow [2024-11-19 09:20:37,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-19 09:20:37,848 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:37,848 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:37,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:20:37,849 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:20:37,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:37,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1667638626, now seen corresponding path program 1 times [2024-11-19 09:20:37,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:37,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750198052] [2024-11-19 09:20:37,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:37,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:38,207 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-19 09:20:38,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:38,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750198052] [2024-11-19 09:20:38,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750198052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:38,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:38,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:20:38,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596476763] [2024-11-19 09:20:38,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:38,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:20:38,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:38,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:20:38,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:20:38,210 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-19 09:20:38,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-19 09:20:38,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:38,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-19 09:20:38,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:38,552 INFO L124 PetriNetUnfolderBase]: 976/1831 cut-off events. [2024-11-19 09:20:38,552 INFO L125 PetriNetUnfolderBase]: For 351/351 co-relation queries the response was YES. [2024-11-19 09:20:38,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4033 conditions, 1831 events. 976/1831 cut-off events. For 351/351 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 9772 event pairs, 469 based on Foata normal form. 0/1699 useless extension candidates. Maximal degree in co-relation 3362. Up to 1060 conditions per place. [2024-11-19 09:20:38,574 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 73 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2024-11-19 09:20:38,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 93 transitions, 429 flow [2024-11-19 09:20:38,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:20:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:20:38,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2024-11-19 09:20:38,576 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6318181818181818 [2024-11-19 09:20:38,576 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 161 flow. Second operand 4 states and 139 transitions. [2024-11-19 09:20:38,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 93 transitions, 429 flow [2024-11-19 09:20:38,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 93 transitions, 429 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 09:20:38,584 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 197 flow [2024-11-19 09:20:38,584 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2024-11-19 09:20:38,585 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2024-11-19 09:20:38,585 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 197 flow [2024-11-19 09:20:38,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-19 09:20:38,585 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:38,586 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:38,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:20:38,586 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:20:38,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:38,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1862289814, now seen corresponding path program 1 times [2024-11-19 09:20:38,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:38,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120501462] [2024-11-19 09:20:38,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:38,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:38,727 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-19 09:20:38,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:38,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120501462] [2024-11-19 09:20:38,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120501462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:38,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:38,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:20:38,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955717806] [2024-11-19 09:20:38,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:38,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:20:38,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:38,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:20:38,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:20:38,732 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-19 09:20:38,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-19 09:20:38,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:38,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-19 09:20:38,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:38,992 INFO L124 PetriNetUnfolderBase]: 1100/2025 cut-off events. [2024-11-19 09:20:38,993 INFO L125 PetriNetUnfolderBase]: For 573/573 co-relation queries the response was YES. [2024-11-19 09:20:38,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4879 conditions, 2025 events. 1100/2025 cut-off events. For 573/573 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10913 event pairs, 511 based on Foata normal form. 22/1918 useless extension candidates. Maximal degree in co-relation 4019. Up to 1290 conditions per place. [2024-11-19 09:20:39,009 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 62 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2024-11-19 09:20:39,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 397 flow [2024-11-19 09:20:39,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:20:39,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:20:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-11-19 09:20:39,011 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2024-11-19 09:20:39,012 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 197 flow. Second operand 3 states and 106 transitions. [2024-11-19 09:20:39,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 397 flow [2024-11-19 09:20:39,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 391 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-19 09:20:39,021 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 203 flow [2024-11-19 09:20:39,022 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2024-11-19 09:20:39,022 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2024-11-19 09:20:39,024 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 203 flow [2024-11-19 09:20:39,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-19 09:20:39,025 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:39,025 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:39,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:20:39,025 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:20:39,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:39,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1621197331, now seen corresponding path program 1 times [2024-11-19 09:20:39,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:39,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528987323] [2024-11-19 09:20:39,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:39,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:39,285 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-19 09:20:39,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:39,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528987323] [2024-11-19 09:20:39,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528987323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:39,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:39,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:20:39,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690834362] [2024-11-19 09:20:39,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:39,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:20:39,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:39,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:20:39,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:20:39,295 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-19 09:20:39,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-19 09:20:39,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:39,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-19 09:20:39,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:39,554 INFO L124 PetriNetUnfolderBase]: 1006/1847 cut-off events. [2024-11-19 09:20:39,554 INFO L125 PetriNetUnfolderBase]: For 474/474 co-relation queries the response was YES. [2024-11-19 09:20:39,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4361 conditions, 1847 events. 1006/1847 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9843 event pairs, 361 based on Foata normal form. 12/1735 useless extension candidates. Maximal degree in co-relation 3862. Up to 1410 conditions per place. [2024-11-19 09:20:39,569 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 49 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-11-19 09:20:39,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 313 flow [2024-11-19 09:20:39,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:20:39,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:20:39,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-11-19 09:20:39,571 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2024-11-19 09:20:39,571 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 203 flow. Second operand 3 states and 96 transitions. [2024-11-19 09:20:39,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 313 flow [2024-11-19 09:20:39,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 303 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-19 09:20:39,577 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 180 flow [2024-11-19 09:20:39,577 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2024-11-19 09:20:39,578 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2024-11-19 09:20:39,578 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 180 flow [2024-11-19 09:20:39,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-19 09:20:39,578 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:39,578 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:39,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:20:39,579 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:20:39,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:39,579 INFO L85 PathProgramCache]: Analyzing trace with hash 952426321, now seen corresponding path program 1 times [2024-11-19 09:20:39,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:39,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119922478] [2024-11-19 09:20:39,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:39,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:40,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:40,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:40,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119922478] [2024-11-19 09:20:40,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119922478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:20:40,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035006165] [2024-11-19 09:20:40,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:40,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:20:40,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:20:40,526 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:20:40,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 09:20:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:40,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 1758 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 09:20:40,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:20:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:41,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:20:41,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:41,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035006165] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:20:41,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:20:41,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2024-11-19 09:20:41,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635782990] [2024-11-19 09:20:41,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:20:41,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 09:20:41,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:41,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 09:20:41,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-19 09:20:41,489 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-19 09:20:41,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 180 flow. Second operand has 15 states, 15 states have (on average 19.0) internal successors, (285), 15 states have internal predecessors, (285), 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-19 09:20:41,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:41,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-19 09:20:41,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:43,808 INFO L124 PetriNetUnfolderBase]: 4128/7712 cut-off events. [2024-11-19 09:20:43,808 INFO L125 PetriNetUnfolderBase]: For 2487/2487 co-relation queries the response was YES. [2024-11-19 09:20:43,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17854 conditions, 7712 events. 4128/7712 cut-off events. For 2487/2487 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 50391 event pairs, 309 based on Foata normal form. 192/7387 useless extension candidates. Maximal degree in co-relation 7413. Up to 1423 conditions per place. [2024-11-19 09:20:43,868 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 327 selfloop transitions, 45 changer transitions 0/386 dead transitions. [2024-11-19 09:20:43,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 386 transitions, 1892 flow [2024-11-19 09:20:43,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 09:20:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-19 09:20:43,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 685 transitions. [2024-11-19 09:20:43,871 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-11-19 09:20:43,871 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 180 flow. Second operand 20 states and 685 transitions. [2024-11-19 09:20:43,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 386 transitions, 1892 flow [2024-11-19 09:20:43,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 386 transitions, 1850 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-11-19 09:20:43,884 INFO L231 Difference]: Finished difference. Result has 92 places, 98 transitions, 592 flow [2024-11-19 09:20:43,884 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=592, PETRI_PLACES=92, PETRI_TRANSITIONS=98} [2024-11-19 09:20:43,885 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 42 predicate places. [2024-11-19 09:20:43,885 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 98 transitions, 592 flow [2024-11-19 09:20:43,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 19.0) internal successors, (285), 15 states have internal predecessors, (285), 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-19 09:20:43,885 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:43,886 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-19 09:20:43,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 09:20:44,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:20:44,090 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:20:44,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:44,091 INFO L85 PathProgramCache]: Analyzing trace with hash 402194878, now seen corresponding path program 1 times [2024-11-19 09:20:44,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:44,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272758546] [2024-11-19 09:20:44,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:44,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:44,403 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-19 09:20:44,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:44,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272758546] [2024-11-19 09:20:44,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272758546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:44,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:44,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:20:44,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394314267] [2024-11-19 09:20:44,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:44,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:20:44,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:44,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:20:44,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:20:44,405 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-19 09:20:44,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 98 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-19 09:20:44,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:44,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-19 09:20:44,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:44,850 INFO L124 PetriNetUnfolderBase]: 1833/3824 cut-off events. [2024-11-19 09:20:44,851 INFO L125 PetriNetUnfolderBase]: For 2280/2280 co-relation queries the response was YES. [2024-11-19 09:20:44,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9375 conditions, 3824 events. 1833/3824 cut-off events. For 2280/2280 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 22372 event pairs, 372 based on Foata normal form. 234/3899 useless extension candidates. Maximal degree in co-relation 9173. Up to 2311 conditions per place. [2024-11-19 09:20:44,885 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 70 selfloop transitions, 4 changer transitions 0/89 dead transitions. [2024-11-19 09:20:44,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 89 transitions, 609 flow [2024-11-19 09:20:44,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:20:44,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:20:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-11-19 09:20:44,886 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5696969696969697 [2024-11-19 09:20:44,886 INFO L175 Difference]: Start difference. First operand has 92 places, 98 transitions, 592 flow. Second operand 3 states and 94 transitions. [2024-11-19 09:20:44,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 89 transitions, 609 flow [2024-11-19 09:20:44,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 89 transitions, 561 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-11-19 09:20:44,902 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 389 flow [2024-11-19 09:20:44,902 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=83, PETRI_TRANSITIONS=78} [2024-11-19 09:20:44,904 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2024-11-19 09:20:44,904 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 389 flow [2024-11-19 09:20:44,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-19 09:20:44,905 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:44,905 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-19 09:20:44,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 09:20:44,905 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:20:44,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:44,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1021159314, now seen corresponding path program 1 times [2024-11-19 09:20:44,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:44,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394362837] [2024-11-19 09:20:44,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:44,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:45,262 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-19 09:20:45,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:45,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394362837] [2024-11-19 09:20:45,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394362837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:45,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:45,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:20:45,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125478339] [2024-11-19 09:20:45,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:45,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:20:45,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:45,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:20:45,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:20:45,282 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-19 09:20:45,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 389 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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-19 09:20:45,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:45,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-19 09:20:45,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:45,710 INFO L124 PetriNetUnfolderBase]: 1838/3722 cut-off events. [2024-11-19 09:20:45,711 INFO L125 PetriNetUnfolderBase]: For 1504/1504 co-relation queries the response was YES. [2024-11-19 09:20:45,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9355 conditions, 3722 events. 1838/3722 cut-off events. For 1504/1504 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 21481 event pairs, 1002 based on Foata normal form. 0/3593 useless extension candidates. Maximal degree in co-relation 7886. Up to 2166 conditions per place. [2024-11-19 09:20:45,742 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 56 selfloop transitions, 18 changer transitions 0/88 dead transitions. [2024-11-19 09:20:45,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 88 transitions, 565 flow [2024-11-19 09:20:45,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:20:45,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:20:45,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-11-19 09:20:45,745 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44363636363636366 [2024-11-19 09:20:45,745 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 389 flow. Second operand 5 states and 122 transitions. [2024-11-19 09:20:45,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 88 transitions, 565 flow [2024-11-19 09:20:45,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 88 transitions, 561 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:20:45,754 INFO L231 Difference]: Finished difference. Result has 85 places, 77 transitions, 419 flow [2024-11-19 09:20:45,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=419, PETRI_PLACES=85, PETRI_TRANSITIONS=77} [2024-11-19 09:20:45,756 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2024-11-19 09:20:45,756 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 77 transitions, 419 flow [2024-11-19 09:20:45,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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-19 09:20:45,757 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:45,757 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-19 09:20:45,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:20:45,759 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:20:45,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:45,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2146835729, now seen corresponding path program 1 times [2024-11-19 09:20:45,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:45,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195122789] [2024-11-19 09:20:45,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:45,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:46,432 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-19 09:20:46,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:46,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195122789] [2024-11-19 09:20:46,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195122789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:46,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:46,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:20:46,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772866530] [2024-11-19 09:20:46,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:46,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:20:46,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:46,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:20:46,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:20:46,460 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-19 09:20:46,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 77 transitions, 419 flow. Second operand has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 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-19 09:20:46,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:46,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-19 09:20:46,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:47,111 INFO L124 PetriNetUnfolderBase]: 1961/3989 cut-off events. [2024-11-19 09:20:47,112 INFO L125 PetriNetUnfolderBase]: For 2208/2208 co-relation queries the response was YES. [2024-11-19 09:20:47,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10043 conditions, 3989 events. 1961/3989 cut-off events. For 2208/2208 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 23119 event pairs, 461 based on Foata normal form. 0/3825 useless extension candidates. Maximal degree in co-relation 8539. Up to 2936 conditions per place. [2024-11-19 09:20:47,137 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 105 selfloop transitions, 8 changer transitions 0/126 dead transitions. [2024-11-19 09:20:47,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 126 transitions, 806 flow [2024-11-19 09:20:47,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:20:47,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:20:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2024-11-19 09:20:47,139 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5116883116883116 [2024-11-19 09:20:47,140 INFO L175 Difference]: Start difference. First operand has 85 places, 77 transitions, 419 flow. Second operand 7 states and 197 transitions. [2024-11-19 09:20:47,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 126 transitions, 806 flow [2024-11-19 09:20:47,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 126 transitions, 762 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:20:47,151 INFO L231 Difference]: Finished difference. Result has 90 places, 82 transitions, 440 flow [2024-11-19 09:20:47,151 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=440, PETRI_PLACES=90, PETRI_TRANSITIONS=82} [2024-11-19 09:20:47,152 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2024-11-19 09:20:47,152 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 440 flow [2024-11-19 09:20:47,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 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-19 09:20:47,152 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:47,155 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-19 09:20:47,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:20:47,155 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:20:47,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:47,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1064566788, now seen corresponding path program 1 times [2024-11-19 09:20:47,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:47,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156314845] [2024-11-19 09:20:47,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:47,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:47,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:47,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:47,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156314845] [2024-11-19 09:20:47,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156314845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:47,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:47,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:20:47,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601827902] [2024-11-19 09:20:47,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:47,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:20:47,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:47,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:20:47,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:20:47,300 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-19 09:20:47,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-19 09:20:47,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:47,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-19 09:20:47,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:47,972 INFO L124 PetriNetUnfolderBase]: 2879/6062 cut-off events. [2024-11-19 09:20:47,973 INFO L125 PetriNetUnfolderBase]: For 3110/3110 co-relation queries the response was YES. [2024-11-19 09:20:48,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15006 conditions, 6062 events. 2879/6062 cut-off events. For 3110/3110 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 40536 event pairs, 1373 based on Foata normal form. 137/5973 useless extension candidates. Maximal degree in co-relation 12979. Up to 3403 conditions per place. [2024-11-19 09:20:48,036 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 124 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2024-11-19 09:20:48,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 140 transitions, 1050 flow [2024-11-19 09:20:48,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:20:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:20:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-11-19 09:20:48,037 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6484848484848484 [2024-11-19 09:20:48,037 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 440 flow. Second operand 3 states and 107 transitions. [2024-11-19 09:20:48,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 140 transitions, 1050 flow [2024-11-19 09:20:48,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 140 transitions, 1038 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:20:48,056 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 445 flow [2024-11-19 09:20:48,056 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=445, PETRI_PLACES=90, PETRI_TRANSITIONS=83} [2024-11-19 09:20:48,057 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2024-11-19 09:20:48,057 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 445 flow [2024-11-19 09:20:48,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-19 09:20:48,057 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:48,057 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] [2024-11-19 09:20:48,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 09:20:48,058 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:20:48,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:48,059 INFO L85 PathProgramCache]: Analyzing trace with hash -26869291, now seen corresponding path program 1 times [2024-11-19 09:20:48,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:48,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099359803] [2024-11-19 09:20:48,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:48,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:48,286 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-19 09:20:48,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:48,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099359803] [2024-11-19 09:20:48,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099359803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:48,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:48,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:20:48,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870300994] [2024-11-19 09:20:48,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:48,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:20:48,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:48,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:20:48,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:20:48,288 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-19 09:20:48,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 83 transitions, 445 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:20:48,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:48,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-19 09:20:48,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:49,151 INFO L124 PetriNetUnfolderBase]: 3194/6486 cut-off events. [2024-11-19 09:20:49,152 INFO L125 PetriNetUnfolderBase]: For 4318/4318 co-relation queries the response was YES. [2024-11-19 09:20:49,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17919 conditions, 6486 events. 3194/6486 cut-off events. For 4318/4318 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 42431 event pairs, 475 based on Foata normal form. 105/6409 useless extension candidates. Maximal degree in co-relation 14839. Up to 2632 conditions per place. [2024-11-19 09:20:49,215 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 109 selfloop transitions, 10 changer transitions 0/133 dead transitions. [2024-11-19 09:20:49,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 133 transitions, 930 flow [2024-11-19 09:20:49,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:20:49,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:20:49,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-11-19 09:20:49,217 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5527272727272727 [2024-11-19 09:20:49,217 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 445 flow. Second operand 5 states and 152 transitions. [2024-11-19 09:20:49,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 133 transitions, 930 flow [2024-11-19 09:20:49,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 133 transitions, 923 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-19 09:20:49,243 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 519 flow [2024-11-19 09:20:49,243 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=519, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2024-11-19 09:20:49,244 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 46 predicate places. [2024-11-19 09:20:49,246 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 519 flow [2024-11-19 09:20:49,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:20:49,246 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:49,247 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-19 09:20:49,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 09:20:49,247 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:20:49,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:49,247 INFO L85 PathProgramCache]: Analyzing trace with hash -716823146, now seen corresponding path program 1 times [2024-11-19 09:20:49,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:49,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648976543] [2024-11-19 09:20:49,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:49,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:51,223 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-19 09:20:51,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:51,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648976543] [2024-11-19 09:20:51,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648976543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:51,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:51,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 09:20:51,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045368274] [2024-11-19 09:20:51,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:51,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:20:51,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:51,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:20:51,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:20:51,273 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-19 09:20:51,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 519 flow. Second operand has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 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-19 09:20:51,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:51,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-19 09:20:51,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:52,734 INFO L124 PetriNetUnfolderBase]: 4726/9653 cut-off events. [2024-11-19 09:20:52,735 INFO L125 PetriNetUnfolderBase]: For 8702/8702 co-relation queries the response was YES. [2024-11-19 09:20:52,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26990 conditions, 9653 events. 4726/9653 cut-off events. For 8702/8702 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 67192 event pairs, 1022 based on Foata normal form. 24/9463 useless extension candidates. Maximal degree in co-relation 21485. Up to 4678 conditions per place. [2024-11-19 09:20:52,827 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 181 selfloop transitions, 24 changer transitions 0/219 dead transitions. [2024-11-19 09:20:52,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 219 transitions, 1565 flow [2024-11-19 09:20:52,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:20:52,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:20:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 316 transitions. [2024-11-19 09:20:52,830 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5223140495867769 [2024-11-19 09:20:52,830 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 519 flow. Second operand 11 states and 316 transitions. [2024-11-19 09:20:52,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 219 transitions, 1565 flow [2024-11-19 09:20:52,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 219 transitions, 1563 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:20:52,867 INFO L231 Difference]: Finished difference. Result has 111 places, 105 transitions, 733 flow [2024-11-19 09:20:52,867 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=733, PETRI_PLACES=111, PETRI_TRANSITIONS=105} [2024-11-19 09:20:52,868 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 61 predicate places. [2024-11-19 09:20:52,868 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 105 transitions, 733 flow [2024-11-19 09:20:52,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 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-19 09:20:52,869 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:52,869 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:52,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 09:20:52,870 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:20:52,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:52,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1731689586, now seen corresponding path program 1 times [2024-11-19 09:20:52,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:52,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455395213] [2024-11-19 09:20:52,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:52,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:53,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:53,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:53,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455395213] [2024-11-19 09:20:53,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455395213] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:20:53,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794112432] [2024-11-19 09:20:53,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:53,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:20:53,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:20:53,045 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:20:53,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 09:20:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:53,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 1794 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:20:53,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:20:53,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:20:53,400 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:20:53,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794112432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:53,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 09:20:53,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2024-11-19 09:20:53,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194895294] [2024-11-19 09:20:53,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:53,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:20:53,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:53,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:20:53,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:20:53,409 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-19 09:20:53,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 105 transitions, 733 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-19 09:20:53,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:53,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-19 09:20:53,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:54,391 INFO L124 PetriNetUnfolderBase]: 4723/9547 cut-off events. [2024-11-19 09:20:54,391 INFO L125 PetriNetUnfolderBase]: For 11746/11746 co-relation queries the response was YES. [2024-11-19 09:20:54,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28269 conditions, 9547 events. 4723/9547 cut-off events. For 11746/11746 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 67477 event pairs, 3763 based on Foata normal form. 31/9348 useless extension candidates. Maximal degree in co-relation 22580. Up to 8111 conditions per place. [2024-11-19 09:20:54,471 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 89 selfloop transitions, 1 changer transitions 2/104 dead transitions. [2024-11-19 09:20:54,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 104 transitions, 913 flow [2024-11-19 09:20:54,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:20:54,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:20:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-19 09:20:54,473 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-11-19 09:20:54,473 INFO L175 Difference]: Start difference. First operand has 111 places, 105 transitions, 733 flow. Second operand 3 states and 80 transitions. [2024-11-19 09:20:54,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 104 transitions, 913 flow [2024-11-19 09:20:54,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 104 transitions, 895 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-19 09:20:54,523 INFO L231 Difference]: Finished difference. Result has 109 places, 102 transitions, 710 flow [2024-11-19 09:20:54,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=710, PETRI_PLACES=109, PETRI_TRANSITIONS=102} [2024-11-19 09:20:54,523 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 59 predicate places. [2024-11-19 09:20:54,524 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 102 transitions, 710 flow [2024-11-19 09:20:54,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-19 09:20:54,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:54,524 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:54,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 09:20:54,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-19 09:20:54,725 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:20:54,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:54,725 INFO L85 PathProgramCache]: Analyzing trace with hash -243320473, now seen corresponding path program 1 times [2024-11-19 09:20:54,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:54,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605729969] [2024-11-19 09:20:54,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:54,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:55,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:55,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605729969] [2024-11-19 09:20:55,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605729969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:20:55,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068031682] [2024-11-19 09:20:55,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:55,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:20:55,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:20:55,442 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:20:55,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 09:20:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:55,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 1839 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 09:20:55,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:20:56,058 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:56,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:20:56,303 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:56,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068031682] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:20:56,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:20:56,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2024-11-19 09:20:56,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971586273] [2024-11-19 09:20:56,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:20:56,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 09:20:56,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:56,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 09:20:56,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-11-19 09:20:56,403 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-11-19 09:20:56,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 102 transitions, 710 flow. Second operand has 18 states, 18 states have (on average 20.166666666666668) internal successors, (363), 18 states have internal predecessors, (363), 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-19 09:20:56,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:56,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-11-19 09:20:56,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:58,954 INFO L124 PetriNetUnfolderBase]: 9891/19922 cut-off events. [2024-11-19 09:20:58,954 INFO L125 PetriNetUnfolderBase]: For 24100/24100 co-relation queries the response was YES. [2024-11-19 09:20:59,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58590 conditions, 19922 events. 9891/19922 cut-off events. For 24100/24100 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 154721 event pairs, 1511 based on Foata normal form. 181/19617 useless extension candidates. Maximal degree in co-relation 58548. Up to 3188 conditions per place. [2024-11-19 09:20:59,206 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 357 selfloop transitions, 91 changer transitions 0/459 dead transitions. [2024-11-19 09:20:59,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 459 transitions, 3593 flow [2024-11-19 09:20:59,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 09:20:59,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-19 09:20:59,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 638 transitions. [2024-11-19 09:20:59,209 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2024-11-19 09:20:59,209 INFO L175 Difference]: Start difference. First operand has 109 places, 102 transitions, 710 flow. Second operand 21 states and 638 transitions. [2024-11-19 09:20:59,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 459 transitions, 3593 flow [2024-11-19 09:20:59,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 459 transitions, 3590 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-19 09:20:59,318 INFO L231 Difference]: Finished difference. Result has 142 places, 167 transitions, 1658 flow [2024-11-19 09:20:59,319 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1658, PETRI_PLACES=142, PETRI_TRANSITIONS=167} [2024-11-19 09:20:59,319 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 92 predicate places. [2024-11-19 09:20:59,319 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 167 transitions, 1658 flow [2024-11-19 09:20:59,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 20.166666666666668) internal successors, (363), 18 states have internal predecessors, (363), 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-19 09:20:59,320 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:59,320 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:59,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 09:20:59,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:20:59,525 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:20:59,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:59,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1208330688, now seen corresponding path program 1 times [2024-11-19 09:20:59,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:59,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126869528] [2024-11-19 09:20:59,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:59,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:59,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:59,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:59,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126869528] [2024-11-19 09:20:59,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126869528] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:20:59,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775415782] [2024-11-19 09:20:59,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:59,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:20:59,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:20:59,929 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:20:59,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 09:21:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:21:00,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 1836 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 09:21:00,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:21:00,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:21:00,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:21:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:21:00,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775415782] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:21:00,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:21:00,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-19 09:21:00,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412240036] [2024-11-19 09:21:00,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:21:00,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:21:00,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:21:00,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:21:00,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:21:00,340 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-11-19 09:21:00,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 167 transitions, 1658 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:21:00,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:21:00,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-11-19 09:21:00,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:21:02,558 INFO L124 PetriNetUnfolderBase]: 8507/17296 cut-off events. [2024-11-19 09:21:02,559 INFO L125 PetriNetUnfolderBase]: For 38133/38133 co-relation queries the response was YES. [2024-11-19 09:21:02,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55240 conditions, 17296 events. 8507/17296 cut-off events. For 38133/38133 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 127468 event pairs, 2450 based on Foata normal form. 14/16895 useless extension candidates. Maximal degree in co-relation 55181. Up to 12999 conditions per place. [2024-11-19 09:21:02,804 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 171 selfloop transitions, 13 changer transitions 0/196 dead transitions. [2024-11-19 09:21:02,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 196 transitions, 2058 flow [2024-11-19 09:21:02,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:21:02,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:21:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2024-11-19 09:21:02,805 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-11-19 09:21:02,805 INFO L175 Difference]: Start difference. First operand has 142 places, 167 transitions, 1658 flow. Second operand 5 states and 165 transitions. [2024-11-19 09:21:02,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 196 transitions, 2058 flow [2024-11-19 09:21:03,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 196 transitions, 1957 flow, removed 46 selfloop flow, removed 3 redundant places. [2024-11-19 09:21:03,006 INFO L231 Difference]: Finished difference. Result has 145 places, 152 transitions, 1446 flow [2024-11-19 09:21:03,006 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1446, PETRI_PLACES=145, PETRI_TRANSITIONS=152} [2024-11-19 09:21:03,006 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 95 predicate places. [2024-11-19 09:21:03,006 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 152 transitions, 1446 flow [2024-11-19 09:21:03,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:21:03,007 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:21:03,007 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 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-19 09:21:03,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 09:21:03,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-19 09:21:03,208 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:21:03,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:21:03,208 INFO L85 PathProgramCache]: Analyzing trace with hash -184443234, now seen corresponding path program 1 times [2024-11-19 09:21:03,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:21:03,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019625538] [2024-11-19 09:21:03,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:21:03,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:21:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:21:03,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:21:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:21:03,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 09:21:03,436 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:21:03,437 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-11-19 09:21:03,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2024-11-19 09:21:03,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2024-11-19 09:21:03,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2024-11-19 09:21:03,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-11-19 09:21:03,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-11-19 09:21:03,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2024-11-19 09:21:03,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-11-19 09:21:03,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-11-19 09:21:03,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2024-11-19 09:21:03,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-11-19 09:21:03,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-11-19 09:21:03,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2024-11-19 09:21:03,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-11-19 09:21:03,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-11-19 09:21:03,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 09:21:03,442 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:21:03,549 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:21:03,549 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:21:03,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:21:03 BasicIcfg [2024-11-19 09:21:03,554 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:21:03,554 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:21:03,555 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:21:03,555 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:21:03,556 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:20:34" (3/4) ... [2024-11-19 09:21:03,557 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:21:03,559 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:21:03,561 INFO L158 Benchmark]: Toolchain (without parser) took 46012.86ms. Allocated memory was 176.2MB in the beginning and 13.0GB in the end (delta: 12.8GB). Free memory was 118.1MB in the beginning and 10.2GB in the end (delta: -10.1GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2024-11-19 09:21:03,561 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:21:03,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 764.96ms. Allocated memory is still 176.2MB. Free memory was 117.4MB in the beginning and 76.1MB in the end (delta: 41.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-19 09:21:03,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 137.07ms. Allocated memory is still 176.2MB. Free memory was 76.1MB in the beginning and 67.1MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 09:21:03,562 INFO L158 Benchmark]: Boogie Preprocessor took 150.30ms. Allocated memory is still 176.2MB. Free memory was 67.1MB in the beginning and 58.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 09:21:03,562 INFO L158 Benchmark]: RCFGBuilder took 15519.63ms. Allocated memory was 176.2MB in the beginning and 11.8GB in the end (delta: 11.7GB). Free memory was 58.7MB in the beginning and 11.2GB in the end (delta: -11.1GB). Peak memory consumption was 702.5MB. Max. memory is 16.1GB. [2024-11-19 09:21:03,562 INFO L158 Benchmark]: TraceAbstraction took 29428.03ms. Allocated memory was 11.8GB in the beginning and 13.0GB in the end (delta: 1.1GB). Free memory was 11.2GB in the beginning and 10.2GB in the end (delta: 1.0GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-11-19 09:21:03,562 INFO L158 Benchmark]: Witness Printer took 4.21ms. Allocated memory is still 13.0GB. Free memory was 10.2GB in the beginning and 10.2GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:21:03,564 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.19ms. Allocated memory is still 176.2MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 764.96ms. Allocated memory is still 176.2MB. Free memory was 117.4MB in the beginning and 76.1MB in the end (delta: 41.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 137.07ms. Allocated memory is still 176.2MB. Free memory was 76.1MB in the beginning and 67.1MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 150.30ms. Allocated memory is still 176.2MB. Free memory was 67.1MB in the beginning and 58.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 15519.63ms. Allocated memory was 176.2MB in the beginning and 11.8GB in the end (delta: 11.7GB). Free memory was 58.7MB in the beginning and 11.2GB in the end (delta: -11.1GB). Peak memory consumption was 702.5MB. Max. memory is 16.1GB. * TraceAbstraction took 29428.03ms. Allocated memory was 11.8GB in the beginning and 13.0GB in the end (delta: 1.1GB). Free memory was 11.2GB in the beginning and 10.2GB in the end (delta: 1.0GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 4.21ms. Allocated memory is still 13.0GB. Free memory was 10.2GB in the beginning and 10.2GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 20. Possible FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1020] 0 pthread_t id1, id2; [L1022] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-3, m={4:0}, top=0] [L989] 1 int i; [L990] 1 unsigned int tmp; [L991] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L991] COND TRUE 1 i<(800) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1023] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-3, id2=-2, m={4:0}, top=0] [L1005] 2 int i; [L1006] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L994] 1 tmp = __VERIFIER_nondet_uint() [L995] CALL 1 assume_abort_if_not(tmp < (800)) [L23] COND FALSE 1 !(!cond) [L995] RET 1 assume_abort_if_not(tmp < (800)) [L996] CALL, EXPR 1 push(arr,tmp) [L961] COND FALSE 1 !(top==(800)) [L968] CALL, EXPR 1 get_top() [L953] 1 return top; [L968] RET, EXPR 1 get_top() [L968] 1 stack[get_top()] = x [L969] CALL 1 inc_top() [L945] 1 top++ [L969] RET 1 inc_top() [L971] 1 return 0; VAL [\old(stack)={3:0}, \old(x)=799, \result=0, arr={3:0}, flag=0, m={4:0}, stack={3:0}, top=1, x=799] [L1006] COND TRUE 2 i<(800) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=1] [L996] RET, EXPR 1 push(arr,tmp) [L996] COND FALSE 1 !(push(arr,tmp)==(-1)) [L998] 1 flag=(1) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=799, top=1] [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND FALSE 2 !(get_top()==0) [L982] CALL 2 dec_top() [L949] 2 top-- [L982] RET 2 dec_top() [L983] CALL, EXPR 2 get_top() [L953] 2 return top; [L983] RET, EXPR 2 get_top() [L983] EXPR 2 stack[get_top()] [L983] 2 return stack[get_top()]; [L1011] RET, EXPR 2 pop(arr) [L1011] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1006] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1006] COND TRUE 2 i<(800) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND TRUE 2 get_top()==0 [L978] 2 return (-2); VAL [\old(stack)={3:0}, \result=-2, arr={3:0}, flag=1, m={4:0}, stack={3:0}, top=0] [L1011] RET, EXPR 2 pop(arr) [L1011] COND TRUE 2 !(pop(arr)!=(-2)) [L1012] CALL 2 error() [L941] CALL 2 reach_error() [L20] COND FALSE 2 !(0) VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L20] 2 __assert_fail ("0", "stack_longest-1.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1018]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1023]: 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: 1022]: 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 85 locations, 15 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: 29.2s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1508 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1454 mSDsluCounter, 181 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 168 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4550 IncrementalHoareTripleChecker+Invalid, 4593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 13 mSDtfsCounter, 4550 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1658occurred in iteration=15, InterpolantAutomatonStates: 108, 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.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 452 NumberOfCodeBlocks, 452 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 3884 SizeOfPredicates, 14 NumberOfNonLiveVariables, 7227 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 7/65 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-19 09:21:03,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/stack_longest-1.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 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:21:06,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:21:06,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:21:06,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:21:06,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:21:06,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:21:06,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:21:06,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:21:06,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:21:06,448 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:21:06,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:21:06,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:21:06,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:21:06,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:21:06,455 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:21:06,455 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:21:06,455 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:21:06,456 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:21:06,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:21:06,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:21:06,456 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:21:06,457 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:21:06,457 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:21:06,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:21:06,458 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:21:06,458 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:21:06,458 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:21:06,458 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:21:06,458 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:21:06,459 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:21:06,459 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:21:06,459 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:21:06,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:21:06,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:21:06,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:21:06,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:21:06,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:21:06,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:21:06,470 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:21:06,471 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:21:06,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:21:06,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:21:06,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:21:06,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:21:06,474 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 -> 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 [2024-11-19 09:21:06,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:21:06,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:21:06,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:21:06,868 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:21:06,869 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:21:06,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longest-1.i [2024-11-19 09:21:08,429 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:21:08,734 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:21:08,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-1.i [2024-11-19 09:21:08,758 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ab46fe91/06a85a511f9741dfb8503b1475df286b/FLAGcc289db81 [2024-11-19 09:21:08,775 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ab46fe91/06a85a511f9741dfb8503b1475df286b [2024-11-19 09:21:08,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:21:08,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:21:08,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:21:08,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:21:08,789 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:21:08,790 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:21:08" (1/1) ... [2024-11-19 09:21:08,791 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4871ebb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:08, skipping insertion in model container [2024-11-19 09:21:08,791 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:21:08" (1/1) ... [2024-11-19 09:21:08,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:21:09,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:21:09,393 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:21:09,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:21:09,605 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:21:09,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:09 WrapperNode [2024-11-19 09:21:09,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:21:09,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:21:09,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:21:09,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:21:09,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:09" (1/1) ... [2024-11-19 09:21:09,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:09" (1/1) ... [2024-11-19 09:21:09,758 INFO L138 Inliner]: procedures = 281, calls = 832, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 952 [2024-11-19 09:21:09,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:21:09,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:21:09,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:21:09,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:21:09,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:09" (1/1) ... [2024-11-19 09:21:09,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:09" (1/1) ... [2024-11-19 09:21:09,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:09" (1/1) ... [2024-11-19 09:21:09,830 INFO L175 MemorySlicer]: Split 809 memory accesses to 3 slices as follows [2, 5, 802]. 99 percent of accesses are in the largest equivalence class. The 807 initializations are split as follows [2, 5, 800]. The 1 writes are split as follows [0, 0, 1]. [2024-11-19 09:21:09,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:09" (1/1) ... [2024-11-19 09:21:09,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:09" (1/1) ... [2024-11-19 09:21:09,916 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:09" (1/1) ... [2024-11-19 09:21:09,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:09" (1/1) ... [2024-11-19 09:21:09,933 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:09" (1/1) ... [2024-11-19 09:21:09,942 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:09" (1/1) ... [2024-11-19 09:21:09,957 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:21:09,958 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:21:09,958 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:21:09,959 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:21:09,960 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:09" (1/1) ... [2024-11-19 09:21:09,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:21:09,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:21:09,998 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-19 09:21:10,001 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-19 09:21:10,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 09:21:10,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 09:21:10,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 09:21:10,052 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-19 09:21:10,052 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-19 09:21:10,052 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-19 09:21:10,053 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-19 09:21:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 09:21:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 09:21:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 09:21:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:21:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:21:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 09:21:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 09:21:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 09:21:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 09:21:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 09:21:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 09:21:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:21:10,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:21:10,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:21:10,057 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:21:10,255 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:21:10,257 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:21:11,826 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:21:11,826 INFO L287 CfgBuilder]: Performing block encoding