./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d6003483da8ad7192acf961571797960398ac6b188954f23484dd2dbf22e0c27 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 19:02:26,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:02:26,613 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 19:02:26,619 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:02:26,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:02:26,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:02:26,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:02:26,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:02:26,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:02:26,649 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:02:26,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:02:26,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:02:26,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:02:26,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:02:26,653 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:02:26,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:02:26,653 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:02:26,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:02:26,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:02:26,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:02:26,654 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 19:02:26,657 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 19:02:26,658 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 19:02:26,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:02:26,658 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 19:02:26,658 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:02:26,659 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:02:26,659 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:02:26,659 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:02:26,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:02:26,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:02:26,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:02:26,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:02:26,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:02:26,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:02:26,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:02:26,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 19:02:26,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 19:02:26,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:02:26,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:02:26,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:02:26,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:02:26,662 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 -> d6003483da8ad7192acf961571797960398ac6b188954f23484dd2dbf22e0c27 [2024-10-24 19:02:27,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:02:27,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:02:27,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:02:27,048 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:02:27,049 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:02:27,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2024-10-24 19:02:28,531 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:02:28,758 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:02:28,759 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2024-10-24 19:02:28,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae6b0ec7/633cb8f8b1b24479a18dfcac65277b19/FLAG158d5ef7c [2024-10-24 19:02:28,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae6b0ec7/633cb8f8b1b24479a18dfcac65277b19 [2024-10-24 19:02:28,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:02:28,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:02:28,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:02:28,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:02:28,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:02:28,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:02:28" (1/1) ... [2024-10-24 19:02:28,835 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7461defa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:28, skipping insertion in model container [2024-10-24 19:02:28,835 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:02:28" (1/1) ... [2024-10-24 19:02:28,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:02:29,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:02:29,179 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 19:02:29,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:02:29,265 INFO L204 MainTranslator]: Completed translation [2024-10-24 19:02:29,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:29 WrapperNode [2024-10-24 19:02:29,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:02:29,267 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 19:02:29,267 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 19:02:29,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 19:02:29,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:29" (1/1) ... [2024-10-24 19:02:29,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:29" (1/1) ... [2024-10-24 19:02:29,329 INFO L138 Inliner]: procedures = 175, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2024-10-24 19:02:29,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 19:02:29,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 19:02:29,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 19:02:29,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 19:02:29,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:29" (1/1) ... [2024-10-24 19:02:29,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:29" (1/1) ... [2024-10-24 19:02:29,345 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:29" (1/1) ... [2024-10-24 19:02:29,369 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-10-24 19:02:29,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:29" (1/1) ... [2024-10-24 19:02:29,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:29" (1/1) ... [2024-10-24 19:02:29,382 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:29" (1/1) ... [2024-10-24 19:02:29,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:29" (1/1) ... [2024-10-24 19:02:29,390 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:29" (1/1) ... [2024-10-24 19:02:29,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:29" (1/1) ... [2024-10-24 19:02:29,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 19:02:29,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 19:02:29,398 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 19:02:29,398 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 19:02:29,399 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:29" (1/1) ... [2024-10-24 19:02:29,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:02:29,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:02:29,430 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 19:02:29,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 19:02:29,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 19:02:29,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 19:02:29,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 19:02:29,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 19:02:29,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-24 19:02:29,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 19:02:29,479 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-24 19:02:29,479 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-24 19:02:29,479 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-24 19:02:29,479 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-24 19:02:29,479 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-24 19:02:29,481 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-24 19:02:29,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 19:02:29,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 19:02:29,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-24 19:02:29,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 19:02:29,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 19:02:29,484 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 19:02:29,658 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 19:02:29,660 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 19:02:29,987 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 19:02:29,987 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 19:02:30,333 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 19:02:30,333 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 19:02:30,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:02:30 BoogieIcfgContainer [2024-10-24 19:02:30,334 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 19:02:30,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 19:02:30,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 19:02:30,339 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 19:02:30,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:02:28" (1/3) ... [2024-10-24 19:02:30,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db10e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:02:30, skipping insertion in model container [2024-10-24 19:02:30,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:29" (2/3) ... [2024-10-24 19:02:30,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db10e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:02:30, skipping insertion in model container [2024-10-24 19:02:30,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:02:30" (3/3) ... [2024-10-24 19:02:30,342 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2024-10-24 19:02:30,357 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 19:02:30,357 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-10-24 19:02:30,357 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 19:02:30,422 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 19:02:30,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 67 transitions, 146 flow [2024-10-24 19:02:30,470 INFO L124 PetriNetUnfolderBase]: 2/64 cut-off events. [2024-10-24 19:02:30,471 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:02:30,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 64 events. 2/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 202 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2024-10-24 19:02:30,475 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 67 transitions, 146 flow [2024-10-24 19:02:30,478 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 64 transitions, 137 flow [2024-10-24 19:02:30,487 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 19:02:30,493 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@60c7d9e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 19:02:30,494 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2024-10-24 19:02:30,497 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 19:02:30,497 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-24 19:02:30,498 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:02:30,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:30,498 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-24 19:02:30,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:30,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:30,504 INFO L85 PathProgramCache]: Analyzing trace with hash 18640882, now seen corresponding path program 1 times [2024-10-24 19:02:30,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:02:30,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102880829] [2024-10-24 19:02:30,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:30,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:02:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:30,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:02:30,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102880829] [2024-10-24 19:02:30,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102880829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:30,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:30,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:02:30,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885879836] [2024-10-24 19:02:30,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:30,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:02:30,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:02:30,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:02:30,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:02:30,881 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 67 [2024-10-24 19:02:30,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:30,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:30,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 67 [2024-10-24 19:02:30,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:31,343 INFO L124 PetriNetUnfolderBase]: 1505/2594 cut-off events. [2024-10-24 19:02:31,343 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:02:31,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4883 conditions, 2594 events. 1505/2594 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 19425 event pairs, 1505 based on Foata normal form. 112/1923 useless extension candidates. Maximal degree in co-relation 4872. Up to 2258 conditions per place. [2024-10-24 19:02:31,426 INFO L140 encePairwiseOnDemand]: 48/67 looper letters, 27 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2024-10-24 19:02:31,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 155 flow [2024-10-24 19:02:31,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:02:31,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:02:31,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-10-24 19:02:31,439 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.527363184079602 [2024-10-24 19:02:31,441 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 137 flow. Second operand 3 states and 106 transitions. [2024-10-24 19:02:31,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 155 flow [2024-10-24 19:02:31,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:02:31,447 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 98 flow [2024-10-24 19:02:31,449 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-10-24 19:02:31,451 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -18 predicate places. [2024-10-24 19:02:31,453 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 98 flow [2024-10-24 19:02:31,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:31,454 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:31,454 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-24 19:02:31,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 19:02:31,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:31,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:31,456 INFO L85 PathProgramCache]: Analyzing trace with hash 18640883, now seen corresponding path program 1 times [2024-10-24 19:02:31,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:02:31,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952180792] [2024-10-24 19:02:31,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:31,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:02:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:31,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:02:31,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952180792] [2024-10-24 19:02:31,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952180792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:31,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:31,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:02:31,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430046727] [2024-10-24 19:02:31,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:31,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:02:31,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:02:31,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:02:31,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:02:31,582 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 67 [2024-10-24 19:02:31,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:31,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:31,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 67 [2024-10-24 19:02:31,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:31,753 INFO L124 PetriNetUnfolderBase]: 501/947 cut-off events. [2024-10-24 19:02:31,753 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:02:31,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1755 conditions, 947 events. 501/947 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6295 event pairs, 501 based on Foata normal form. 0/857 useless extension candidates. Maximal degree in co-relation 1749. Up to 784 conditions per place. [2024-10-24 19:02:31,758 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 20 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-10-24 19:02:31,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 130 flow [2024-10-24 19:02:31,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:02:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:02:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-10-24 19:02:31,760 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43781094527363185 [2024-10-24 19:02:31,760 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 98 flow. Second operand 3 states and 88 transitions. [2024-10-24 19:02:31,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 130 flow [2024-10-24 19:02:31,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 129 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:02:31,762 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2024-10-24 19:02:31,762 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-10-24 19:02:31,763 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -23 predicate places. [2024-10-24 19:02:31,763 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2024-10-24 19:02:31,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:31,764 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:31,764 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:02:31,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 19:02:31,764 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:31,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:31,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1166364976, now seen corresponding path program 1 times [2024-10-24 19:02:31,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:02:31,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088178566] [2024-10-24 19:02:31,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:31,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:02:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:31,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:02:31,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088178566] [2024-10-24 19:02:31,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088178566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:31,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:31,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:02:31,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783783839] [2024-10-24 19:02:31,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:31,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:02:31,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:02:31,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:02:31,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:02:31,867 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 67 [2024-10-24 19:02:31,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 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-10-24 19:02:31,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:31,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 67 [2024-10-24 19:02:31,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:32,094 INFO L124 PetriNetUnfolderBase]: 419/926 cut-off events. [2024-10-24 19:02:32,095 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:02:32,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1613 conditions, 926 events. 419/926 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6481 event pairs, 91 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1606. Up to 517 conditions per place. [2024-10-24 19:02:32,103 INFO L140 encePairwiseOnDemand]: 63/67 looper letters, 34 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2024-10-24 19:02:32,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 191 flow [2024-10-24 19:02:32,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:02:32,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:02:32,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-10-24 19:02:32,105 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48756218905472637 [2024-10-24 19:02:32,105 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 3 states and 98 transitions. [2024-10-24 19:02:32,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 191 flow [2024-10-24 19:02:32,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:02:32,108 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2024-10-24 19:02:32,108 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-10-24 19:02:32,109 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -22 predicate places. [2024-10-24 19:02:32,109 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2024-10-24 19:02:32,109 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-10-24 19:02:32,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:32,109 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:02:32,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 19:02:32,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:32,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:32,111 INFO L85 PathProgramCache]: Analyzing trace with hash 109792227, now seen corresponding path program 1 times [2024-10-24 19:02:32,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:02:32,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190866747] [2024-10-24 19:02:32,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:32,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:02:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:32,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:32,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:02:32,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190866747] [2024-10-24 19:02:32,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190866747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:32,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:32,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:02:32,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396884774] [2024-10-24 19:02:32,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:32,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:02:32,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:02:32,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:02:32,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:02:32,216 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 67 [2024-10-24 19:02:32,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:32,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:32,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 67 [2024-10-24 19:02:32,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:32,379 INFO L124 PetriNetUnfolderBase]: 391/882 cut-off events. [2024-10-24 19:02:32,380 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-10-24 19:02:32,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1683 conditions, 882 events. 391/882 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6094 event pairs, 83 based on Foata normal form. 0/862 useless extension candidates. Maximal degree in co-relation 1674. Up to 472 conditions per place. [2024-10-24 19:02:32,384 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 33 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-10-24 19:02:32,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 194 flow [2024-10-24 19:02:32,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:02:32,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:02:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-10-24 19:02:32,386 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43283582089552236 [2024-10-24 19:02:32,386 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 116 transitions. [2024-10-24 19:02:32,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 194 flow [2024-10-24 19:02:32,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:02:32,387 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2024-10-24 19:02:32,387 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2024-10-24 19:02:32,388 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -22 predicate places. [2024-10-24 19:02:32,388 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2024-10-24 19:02:32,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:32,388 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:32,389 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:02:32,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 19:02:32,389 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:32,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:32,389 INFO L85 PathProgramCache]: Analyzing trace with hash 109792228, now seen corresponding path program 1 times [2024-10-24 19:02:32,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:02:32,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293405028] [2024-10-24 19:02:32,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:32,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:02:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:32,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:32,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:02:32,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293405028] [2024-10-24 19:02:32,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293405028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:32,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:32,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:02:32,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169562096] [2024-10-24 19:02:32,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:32,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:02:32,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:02:32,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:02:32,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:02:32,563 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 67 [2024-10-24 19:02:32,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:32,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:32,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 67 [2024-10-24 19:02:32,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:32,705 INFO L124 PetriNetUnfolderBase]: 363/696 cut-off events. [2024-10-24 19:02:32,706 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-10-24 19:02:32,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1437 conditions, 696 events. 363/696 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4057 event pairs, 181 based on Foata normal form. 16/700 useless extension candidates. Maximal degree in co-relation 1428. Up to 428 conditions per place. [2024-10-24 19:02:32,710 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-10-24 19:02:32,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 188 flow [2024-10-24 19:02:32,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:02:32,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:02:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-10-24 19:02:32,713 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4291044776119403 [2024-10-24 19:02:32,713 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 115 transitions. [2024-10-24 19:02:32,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 188 flow [2024-10-24 19:02:32,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 183 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:02:32,715 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2024-10-24 19:02:32,715 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2024-10-24 19:02:32,717 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -23 predicate places. [2024-10-24 19:02:32,717 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2024-10-24 19:02:32,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:32,718 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:32,718 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:02:32,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 19:02:32,718 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:32,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:32,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1911519477, now seen corresponding path program 1 times [2024-10-24 19:02:32,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:02:32,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472346555] [2024-10-24 19:02:32,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:32,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:02:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:32,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:32,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:02:32,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472346555] [2024-10-24 19:02:32,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472346555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:32,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:32,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:02:32,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524976604] [2024-10-24 19:02:32,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:32,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:02:32,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:02:32,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:02:32,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:02:32,767 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 67 [2024-10-24 19:02:32,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 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-10-24 19:02:32,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:32,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 67 [2024-10-24 19:02:32,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:32,855 INFO L124 PetriNetUnfolderBase]: 363/713 cut-off events. [2024-10-24 19:02:32,856 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-10-24 19:02:32,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1453 conditions, 713 events. 363/713 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4583 event pairs, 363 based on Foata normal form. 24/707 useless extension candidates. Maximal degree in co-relation 1445. Up to 574 conditions per place. [2024-10-24 19:02:32,859 INFO L140 encePairwiseOnDemand]: 65/67 looper letters, 17 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-10-24 19:02:32,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 121 flow [2024-10-24 19:02:32,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:02:32,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:02:32,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-10-24 19:02:32,861 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38308457711442784 [2024-10-24 19:02:32,861 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 77 transitions. [2024-10-24 19:02:32,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 121 flow [2024-10-24 19:02:32,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:02:32,862 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2024-10-24 19:02:32,862 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2024-10-24 19:02:32,863 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -24 predicate places. [2024-10-24 19:02:32,863 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2024-10-24 19:02:32,863 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-10-24 19:02:32,863 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:32,863 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:02:32,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 19:02:32,863 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:32,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:32,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1911520322, now seen corresponding path program 1 times [2024-10-24 19:02:32,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:02:32,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41895065] [2024-10-24 19:02:32,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:32,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:02:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:32,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:32,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:02:32,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41895065] [2024-10-24 19:02:32,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41895065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:32,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:32,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:02:32,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875647690] [2024-10-24 19:02:32,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:32,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:02:32,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:02:32,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:02:32,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:02:32,985 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 67 [2024-10-24 19:02:32,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 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-10-24 19:02:32,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:32,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 67 [2024-10-24 19:02:32,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:33,203 INFO L124 PetriNetUnfolderBase]: 1016/1730 cut-off events. [2024-10-24 19:02:33,203 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:02:33,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3573 conditions, 1730 events. 1016/1730 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10139 event pairs, 96 based on Foata normal form. 60/1774 useless extension candidates. Maximal degree in co-relation 3565. Up to 1015 conditions per place. [2024-10-24 19:02:33,211 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 37 selfloop transitions, 5 changer transitions 1/55 dead transitions. [2024-10-24 19:02:33,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 216 flow [2024-10-24 19:02:33,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:02:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:02:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-10-24 19:02:33,213 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40671641791044777 [2024-10-24 19:02:33,213 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 4 states and 109 transitions. [2024-10-24 19:02:33,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 216 flow [2024-10-24 19:02:33,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:02:33,214 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 113 flow [2024-10-24 19:02:33,214 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2024-10-24 19:02:33,214 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -21 predicate places. [2024-10-24 19:02:33,215 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 113 flow [2024-10-24 19:02:33,215 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-10-24 19:02:33,215 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:33,215 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:02:33,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 19:02:33,215 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:33,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:33,216 INFO L85 PathProgramCache]: Analyzing trace with hash 921418596, now seen corresponding path program 1 times [2024-10-24 19:02:33,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:02:33,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993061123] [2024-10-24 19:02:33,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:33,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:02:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:33,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:33,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:02:33,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993061123] [2024-10-24 19:02:33,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993061123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:33,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:33,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:02:33,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788790632] [2024-10-24 19:02:33,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:33,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:02:33,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:02:33,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:02:33,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:02:33,370 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 67 [2024-10-24 19:02:33,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:33,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:33,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 67 [2024-10-24 19:02:33,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:33,619 INFO L124 PetriNetUnfolderBase]: 690/1200 cut-off events. [2024-10-24 19:02:33,620 INFO L125 PetriNetUnfolderBase]: For 321/335 co-relation queries the response was YES. [2024-10-24 19:02:33,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2900 conditions, 1200 events. 690/1200 cut-off events. For 321/335 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6203 event pairs, 36 based on Foata normal form. 56/1244 useless extension candidates. Maximal degree in co-relation 2889. Up to 553 conditions per place. [2024-10-24 19:02:33,627 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 46 selfloop transitions, 8 changer transitions 1/67 dead transitions. [2024-10-24 19:02:33,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 67 transitions, 310 flow [2024-10-24 19:02:33,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:02:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:02:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-10-24 19:02:33,629 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.408955223880597 [2024-10-24 19:02:33,629 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 113 flow. Second operand 5 states and 137 transitions. [2024-10-24 19:02:33,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 67 transitions, 310 flow [2024-10-24 19:02:33,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 300 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-24 19:02:33,634 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 153 flow [2024-10-24 19:02:33,636 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2024-10-24 19:02:33,636 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -17 predicate places. [2024-10-24 19:02:33,637 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 153 flow [2024-10-24 19:02:33,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:33,637 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:33,637 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-10-24 19:02:33,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 19:02:33,638 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:33,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:33,639 INFO L85 PathProgramCache]: Analyzing trace with hash -145149866, now seen corresponding path program 1 times [2024-10-24 19:02:33,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:02:33,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408215372] [2024-10-24 19:02:33,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:33,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:02:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:33,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:33,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:02:33,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408215372] [2024-10-24 19:02:33,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408215372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:33,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:33,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:02:33,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144366815] [2024-10-24 19:02:33,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:33,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:02:33,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:02:33,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:02:33,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:02:33,856 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 67 [2024-10-24 19:02:33,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:33,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:33,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 67 [2024-10-24 19:02:33,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:34,034 INFO L124 PetriNetUnfolderBase]: 371/643 cut-off events. [2024-10-24 19:02:34,034 INFO L125 PetriNetUnfolderBase]: For 581/612 co-relation queries the response was YES. [2024-10-24 19:02:34,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 643 events. 371/643 cut-off events. For 581/612 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2649 event pairs, 25 based on Foata normal form. 36/667 useless extension candidates. Maximal degree in co-relation 1781. Up to 228 conditions per place. [2024-10-24 19:02:34,038 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 41 selfloop transitions, 11 changer transitions 1/65 dead transitions. [2024-10-24 19:02:34,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 323 flow [2024-10-24 19:02:34,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:02:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:02:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-10-24 19:02:34,040 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3756218905472637 [2024-10-24 19:02:34,040 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 153 flow. Second operand 6 states and 151 transitions. [2024-10-24 19:02:34,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 323 flow [2024-10-24 19:02:34,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 65 transitions, 298 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-24 19:02:34,042 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 167 flow [2024-10-24 19:02:34,043 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2024-10-24 19:02:34,043 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -14 predicate places. [2024-10-24 19:02:34,043 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 167 flow [2024-10-24 19:02:34,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:34,044 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:34,044 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:02:34,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 19:02:34,044 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:34,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:34,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2112588852, now seen corresponding path program 1 times [2024-10-24 19:02:34,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:02:34,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273875414] [2024-10-24 19:02:34,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:34,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:02:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:34,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:34,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:02:34,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273875414] [2024-10-24 19:02:34,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273875414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:34,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:34,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:02:34,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130122070] [2024-10-24 19:02:34,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:34,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:02:34,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:02:34,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:02:34,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:02:34,313 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 67 [2024-10-24 19:02:34,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:34,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:34,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 67 [2024-10-24 19:02:34,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:34,487 INFO L124 PetriNetUnfolderBase]: 442/888 cut-off events. [2024-10-24 19:02:34,488 INFO L125 PetriNetUnfolderBase]: For 491/505 co-relation queries the response was YES. [2024-10-24 19:02:34,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2200 conditions, 888 events. 442/888 cut-off events. For 491/505 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4651 event pairs, 83 based on Foata normal form. 8/860 useless extension candidates. Maximal degree in co-relation 2186. Up to 284 conditions per place. [2024-10-24 19:02:34,492 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 26 selfloop transitions, 3 changer transitions 17/66 dead transitions. [2024-10-24 19:02:34,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 66 transitions, 325 flow [2024-10-24 19:02:34,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:02:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:02:34,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2024-10-24 19:02:34,493 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3855721393034826 [2024-10-24 19:02:34,493 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 167 flow. Second operand 6 states and 155 transitions. [2024-10-24 19:02:34,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 66 transitions, 325 flow [2024-10-24 19:02:34,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 261 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-10-24 19:02:34,497 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 125 flow [2024-10-24 19:02:34,497 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=125, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2024-10-24 19:02:34,497 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -14 predicate places. [2024-10-24 19:02:34,497 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 125 flow [2024-10-24 19:02:34,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:34,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:34,498 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:02:34,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 19:02:34,498 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:34,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:34,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1731217782, now seen corresponding path program 2 times [2024-10-24 19:02:34,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:02:34,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131970499] [2024-10-24 19:02:34,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:34,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:02:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:34,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:02:34,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131970499] [2024-10-24 19:02:34,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131970499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:34,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:34,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:02:34,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507030922] [2024-10-24 19:02:34,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:34,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:02:34,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:02:34,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:02:34,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:02:34,806 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 67 [2024-10-24 19:02:34,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:34,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:34,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 67 [2024-10-24 19:02:34,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:34,958 INFO L124 PetriNetUnfolderBase]: 398/832 cut-off events. [2024-10-24 19:02:34,959 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-24 19:02:34,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1740 conditions, 832 events. 398/832 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4383 event pairs, 165 based on Foata normal form. 8/792 useless extension candidates. Maximal degree in co-relation 1727. Up to 233 conditions per place. [2024-10-24 19:02:34,962 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 26 selfloop transitions, 3 changer transitions 19/68 dead transitions. [2024-10-24 19:02:34,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 287 flow [2024-10-24 19:02:34,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:02:34,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:02:34,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2024-10-24 19:02:34,964 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39054726368159204 [2024-10-24 19:02:34,964 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 125 flow. Second operand 6 states and 157 transitions. [2024-10-24 19:02:34,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 287 flow [2024-10-24 19:02:34,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 68 transitions, 271 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-24 19:02:34,965 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 127 flow [2024-10-24 19:02:34,965 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=127, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2024-10-24 19:02:34,966 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2024-10-24 19:02:34,966 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 127 flow [2024-10-24 19:02:34,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:34,968 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:34,969 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:02:34,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 19:02:34,969 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:34,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:34,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1459192020, now seen corresponding path program 3 times [2024-10-24 19:02:34,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:02:34,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072946782] [2024-10-24 19:02:34,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:34,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:02:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:02:35,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 19:02:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:02:35,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 19:02:35,107 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 19:02:35,108 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (46 of 47 remaining) [2024-10-24 19:02:35,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 47 remaining) [2024-10-24 19:02:35,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 47 remaining) [2024-10-24 19:02:35,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 47 remaining) [2024-10-24 19:02:35,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 47 remaining) [2024-10-24 19:02:35,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 47 remaining) [2024-10-24 19:02:35,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 47 remaining) [2024-10-24 19:02:35,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 47 remaining) [2024-10-24 19:02:35,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 47 remaining) [2024-10-24 19:02:35,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 47 remaining) [2024-10-24 19:02:35,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 47 remaining) [2024-10-24 19:02:35,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 47 remaining) [2024-10-24 19:02:35,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 47 remaining) [2024-10-24 19:02:35,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 47 remaining) [2024-10-24 19:02:35,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 47 remaining) [2024-10-24 19:02:35,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 47 remaining) [2024-10-24 19:02:35,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 47 remaining) [2024-10-24 19:02:35,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 47 remaining) [2024-10-24 19:02:35,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 47 remaining) [2024-10-24 19:02:35,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 47 remaining) [2024-10-24 19:02:35,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 47 remaining) [2024-10-24 19:02:35,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 47 remaining) [2024-10-24 19:02:35,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 47 remaining) [2024-10-24 19:02:35,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 47 remaining) [2024-10-24 19:02:35,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 47 remaining) [2024-10-24 19:02:35,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (21 of 47 remaining) [2024-10-24 19:02:35,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 47 remaining) [2024-10-24 19:02:35,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 47 remaining) [2024-10-24 19:02:35,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 47 remaining) [2024-10-24 19:02:35,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 47 remaining) [2024-10-24 19:02:35,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 47 remaining) [2024-10-24 19:02:35,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 47 remaining) [2024-10-24 19:02:35,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 47 remaining) [2024-10-24 19:02:35,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 47 remaining) [2024-10-24 19:02:35,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 47 remaining) [2024-10-24 19:02:35,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 47 remaining) [2024-10-24 19:02:35,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 47 remaining) [2024-10-24 19:02:35,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 47 remaining) [2024-10-24 19:02:35,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 47 remaining) [2024-10-24 19:02:35,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 47 remaining) [2024-10-24 19:02:35,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 47 remaining) [2024-10-24 19:02:35,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 47 remaining) [2024-10-24 19:02:35,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 47 remaining) [2024-10-24 19:02:35,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 47 remaining) [2024-10-24 19:02:35,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 47 remaining) [2024-10-24 19:02:35,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 47 remaining) [2024-10-24 19:02:35,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 47 remaining) [2024-10-24 19:02:35,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 19:02:35,119 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:02:35,198 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 19:02:35,198 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 19:02:35,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:02:35 BasicIcfg [2024-10-24 19:02:35,203 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 19:02:35,203 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 19:02:35,203 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 19:02:35,203 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 19:02:35,204 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:02:30" (3/4) ... [2024-10-24 19:02:35,205 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 19:02:35,206 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 19:02:35,207 INFO L158 Benchmark]: Toolchain (without parser) took 6385.16ms. Allocated memory was 172.0MB in the beginning and 406.8MB in the end (delta: 234.9MB). Free memory was 121.6MB in the beginning and 214.6MB in the end (delta: -93.0MB). Peak memory consumption was 140.3MB. Max. memory is 16.1GB. [2024-10-24 19:02:35,207 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory was 64.6MB in the beginning and 64.6MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:02:35,207 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.40ms. Allocated memory is still 172.0MB. Free memory was 121.6MB in the beginning and 139.8MB in the end (delta: -18.3MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2024-10-24 19:02:35,207 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.79ms. Allocated memory is still 172.0MB. Free memory was 139.3MB in the beginning and 136.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 19:02:35,207 INFO L158 Benchmark]: Boogie Preprocessor took 64.89ms. Allocated memory is still 172.0MB. Free memory was 136.7MB in the beginning and 133.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 19:02:35,208 INFO L158 Benchmark]: RCFGBuilder took 935.82ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 133.6MB in the beginning and 147.4MB in the end (delta: -13.9MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2024-10-24 19:02:35,208 INFO L158 Benchmark]: TraceAbstraction took 4867.29ms. Allocated memory was 207.6MB in the beginning and 406.8MB in the end (delta: 199.2MB). Free memory was 146.4MB in the beginning and 214.6MB in the end (delta: -68.2MB). Peak memory consumption was 129.9MB. Max. memory is 16.1GB. [2024-10-24 19:02:35,208 INFO L158 Benchmark]: Witness Printer took 3.06ms. Allocated memory is still 406.8MB. Free memory is still 214.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:02:35,209 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 100.7MB. Free memory was 64.6MB in the beginning and 64.6MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.40ms. Allocated memory is still 172.0MB. Free memory was 121.6MB in the beginning and 139.8MB in the end (delta: -18.3MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.79ms. Allocated memory is still 172.0MB. Free memory was 139.3MB in the beginning and 136.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.89ms. Allocated memory is still 172.0MB. Free memory was 136.7MB in the beginning and 133.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 935.82ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 133.6MB in the beginning and 147.4MB in the end (delta: -13.9MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4867.29ms. Allocated memory was 207.6MB in the beginning and 406.8MB in the end (delta: 199.2MB). Free memory was 146.4MB in the beginning and 214.6MB in the end (delta: -68.2MB). Peak memory consumption was 129.9MB. Max. memory is 16.1GB. * Witness Printer took 3.06ms. Allocated memory is still 406.8MB. Free memory is still 214.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1949; [L837] FCALL, FORK 0 pthread_create(&t1949, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1949=-3, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] EXPR 1 \read(z) [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L769] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L770] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L771] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L773] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L776] EXPR 1 \read(z) [L776] 1 __unbuffered_p0_EAX = z [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] 1 z = z$flush_delayed ? z$mem_tmp : z [L778] 1 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L838] 0 pthread_t t1950; [L839] FCALL, FORK 0 pthread_create(&t1950, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1949=-3, t1950=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L840] 0 pthread_t t1951; [L841] FCALL, FORK 0 pthread_create(&t1951, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1949=-3, t1950=-2, t1951=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L781] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L793] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L796] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L808] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L811] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 \read(z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1949=-3, t1950=-2, t1951=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 \read(z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1949=-3, t1950=-2, t1951=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L854] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1949=-3, t1950=-2, t1951=-1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L18] 0 __assert_fail ("0", "safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - 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: -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: -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: -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: -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: -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: -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: -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: -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: -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: -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: -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: 834]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 837]: 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: 839]: 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: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 108 locations, 47 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 367 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 350 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 645 IncrementalHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 10 mSDtfsCounter, 645 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=9, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 632 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 19:02:35,233 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d6003483da8ad7192acf961571797960398ac6b188954f23484dd2dbf22e0c27 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 19:02:37,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:02:37,403 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 19:02:37,410 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:02:37,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:02:37,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:02:37,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:02:37,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:02:37,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:02:37,448 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:02:37,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:02:37,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:02:37,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:02:37,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:02:37,451 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:02:37,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:02:37,451 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:02:37,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:02:37,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:02:37,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:02:37,455 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 19:02:37,455 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 19:02:37,455 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 19:02:37,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:02:37,456 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 19:02:37,456 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 19:02:37,456 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:02:37,456 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 19:02:37,456 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:02:37,457 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:02:37,457 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:02:37,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:02:37,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:02:37,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:02:37,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:02:37,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:02:37,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:02:37,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:02:37,463 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 19:02:37,463 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 19:02:37,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:02:37,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:02:37,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:02:37,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:02:37,464 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 19:02:37,465 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 -> d6003483da8ad7192acf961571797960398ac6b188954f23484dd2dbf22e0c27 [2024-10-24 19:02:37,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:02:37,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:02:37,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:02:37,864 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:02:37,866 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:02:37,868 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2024-10-24 19:02:39,374 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:02:39,622 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:02:39,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2024-10-24 19:02:39,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/182a1b652/8f47c72cf78344909a14532073c0e95b/FLAGd3ee413a5 [2024-10-24 19:02:39,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/182a1b652/8f47c72cf78344909a14532073c0e95b [2024-10-24 19:02:39,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:02:39,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:02:39,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:02:39,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:02:39,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:02:39,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:02:39" (1/1) ... [2024-10-24 19:02:39,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b7edd2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:39, skipping insertion in model container [2024-10-24 19:02:39,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:02:39" (1/1) ... [2024-10-24 19:02:39,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:02:40,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:02:40,038 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 19:02:40,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:02:40,142 INFO L204 MainTranslator]: Completed translation [2024-10-24 19:02:40,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:40 WrapperNode [2024-10-24 19:02:40,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:02:40,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 19:02:40,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 19:02:40,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 19:02:40,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:40" (1/1) ... [2024-10-24 19:02:40,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:40" (1/1) ... [2024-10-24 19:02:40,201 INFO L138 Inliner]: procedures = 179, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2024-10-24 19:02:40,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 19:02:40,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 19:02:40,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 19:02:40,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 19:02:40,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:40" (1/1) ... [2024-10-24 19:02:40,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:40" (1/1) ... [2024-10-24 19:02:40,220 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:40" (1/1) ... [2024-10-24 19:02:40,239 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-10-24 19:02:40,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:40" (1/1) ... [2024-10-24 19:02:40,240 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:40" (1/1) ... [2024-10-24 19:02:40,245 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:40" (1/1) ... [2024-10-24 19:02:40,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:40" (1/1) ... [2024-10-24 19:02:40,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:40" (1/1) ... [2024-10-24 19:02:40,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:40" (1/1) ... [2024-10-24 19:02:40,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 19:02:40,272 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 19:02:40,272 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 19:02:40,273 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 19:02:40,273 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:40" (1/1) ... [2024-10-24 19:02:40,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:02:40,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:02:40,304 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 19:02:40,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 19:02:40,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 19:02:40,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 19:02:40,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-24 19:02:40,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 19:02:40,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 19:02:40,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 19:02:40,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 19:02:40,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 19:02:40,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 19:02:40,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 19:02:40,348 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-24 19:02:40,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-24 19:02:40,348 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-24 19:02:40,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-24 19:02:40,348 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-24 19:02:40,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-24 19:02:40,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-24 19:02:40,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 19:02:40,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 19:02:40,352 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 19:02:40,512 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 19:02:40,514 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 19:02:40,932 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 19:02:40,932 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 19:02:41,318 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 19:02:41,318 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 19:02:41,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:02:41 BoogieIcfgContainer [2024-10-24 19:02:41,319 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 19:02:41,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 19:02:41,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 19:02:41,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 19:02:41,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:02:39" (1/3) ... [2024-10-24 19:02:41,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697dd678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:02:41, skipping insertion in model container [2024-10-24 19:02:41,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:02:40" (2/3) ... [2024-10-24 19:02:41,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697dd678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:02:41, skipping insertion in model container [2024-10-24 19:02:41,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:02:41" (3/3) ... [2024-10-24 19:02:41,327 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2024-10-24 19:02:41,341 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 19:02:41,341 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-10-24 19:02:41,341 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 19:02:41,466 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 19:02:41,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 67 transitions, 146 flow [2024-10-24 19:02:41,581 INFO L124 PetriNetUnfolderBase]: 2/64 cut-off events. [2024-10-24 19:02:41,584 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:02:41,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 64 events. 2/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 202 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2024-10-24 19:02:41,588 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 67 transitions, 146 flow [2024-10-24 19:02:41,595 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 64 transitions, 137 flow [2024-10-24 19:02:41,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 19:02:41,623 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;@3e1152b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 19:02:41,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2024-10-24 19:02:41,631 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 19:02:41,632 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-24 19:02:41,632 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:02:41,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:41,633 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-24 19:02:41,633 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:41,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:41,642 INFO L85 PathProgramCache]: Analyzing trace with hash 18702450, now seen corresponding path program 1 times [2024-10-24 19:02:41,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:02:41,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349777527] [2024-10-24 19:02:41,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:41,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:41,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:02:41,671 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:02:41,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 19:02:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:41,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:02:41,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:02:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:41,841 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:02:41,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:02:41,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349777527] [2024-10-24 19:02:41,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349777527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:41,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:41,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:02:41,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71043874] [2024-10-24 19:02:41,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:41,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:02:41,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:02:41,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:02:41,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:02:41,879 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 67 [2024-10-24 19:02:41,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:41,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:41,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 67 [2024-10-24 19:02:41,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:42,352 INFO L124 PetriNetUnfolderBase]: 1505/2594 cut-off events. [2024-10-24 19:02:42,353 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:02:42,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4883 conditions, 2594 events. 1505/2594 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 19425 event pairs, 1505 based on Foata normal form. 112/1923 useless extension candidates. Maximal degree in co-relation 4872. Up to 2258 conditions per place. [2024-10-24 19:02:42,371 INFO L140 encePairwiseOnDemand]: 48/67 looper letters, 27 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2024-10-24 19:02:42,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 155 flow [2024-10-24 19:02:42,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:02:42,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:02:42,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-10-24 19:02:42,381 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.527363184079602 [2024-10-24 19:02:42,383 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 137 flow. Second operand 3 states and 106 transitions. [2024-10-24 19:02:42,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 155 flow [2024-10-24 19:02:42,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:02:42,391 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 98 flow [2024-10-24 19:02:42,393 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-10-24 19:02:42,395 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -18 predicate places. [2024-10-24 19:02:42,396 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 98 flow [2024-10-24 19:02:42,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:42,396 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:42,396 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-24 19:02:42,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 19:02:42,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:42,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:42,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:42,601 INFO L85 PathProgramCache]: Analyzing trace with hash 18702451, now seen corresponding path program 1 times [2024-10-24 19:02:42,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:02:42,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074630484] [2024-10-24 19:02:42,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:42,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:42,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:02:42,605 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:02:42,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 19:02:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:42,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 19:02:42,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:02:42,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:42,725 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:02:42,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:02:42,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074630484] [2024-10-24 19:02:42,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074630484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:42,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:42,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:02:42,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296419324] [2024-10-24 19:02:42,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:42,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:02:42,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:02:42,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:02:42,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:02:42,727 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 67 [2024-10-24 19:02:42,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:42,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:42,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 67 [2024-10-24 19:02:42,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:42,880 INFO L124 PetriNetUnfolderBase]: 501/947 cut-off events. [2024-10-24 19:02:42,880 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:02:42,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1755 conditions, 947 events. 501/947 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6295 event pairs, 501 based on Foata normal form. 0/857 useless extension candidates. Maximal degree in co-relation 1749. Up to 784 conditions per place. [2024-10-24 19:02:42,886 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 20 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-10-24 19:02:42,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 130 flow [2024-10-24 19:02:42,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:02:42,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:02:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-10-24 19:02:42,887 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43781094527363185 [2024-10-24 19:02:42,887 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 98 flow. Second operand 3 states and 88 transitions. [2024-10-24 19:02:42,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 130 flow [2024-10-24 19:02:42,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 129 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:02:42,888 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2024-10-24 19:02:42,888 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-10-24 19:02:42,889 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -23 predicate places. [2024-10-24 19:02:42,889 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2024-10-24 19:02:42,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:42,889 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:42,890 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:02:42,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 19:02:43,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:43,090 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:43,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:43,091 INFO L85 PathProgramCache]: Analyzing trace with hash 846558610, now seen corresponding path program 1 times [2024-10-24 19:02:43,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:02:43,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859250517] [2024-10-24 19:02:43,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:43,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:43,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:02:43,094 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:02:43,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 19:02:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:43,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:02:43,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:02:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:43,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:02:43,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:02:43,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859250517] [2024-10-24 19:02:43,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1859250517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:43,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:43,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:02:43,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152271122] [2024-10-24 19:02:43,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:43,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:02:43,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:02:43,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:02:43,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:02:43,236 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 67 [2024-10-24 19:02:43,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:43,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:43,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 67 [2024-10-24 19:02:43,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:43,562 INFO L124 PetriNetUnfolderBase]: 1361/2291 cut-off events. [2024-10-24 19:02:43,562 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:02:43,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4390 conditions, 2291 events. 1361/2291 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 14221 event pairs, 96 based on Foata normal form. 60/2227 useless extension candidates. Maximal degree in co-relation 4383. Up to 1522 conditions per place. [2024-10-24 19:02:43,575 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 40 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2024-10-24 19:02:43,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 223 flow [2024-10-24 19:02:43,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:02:43,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:02:43,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2024-10-24 19:02:43,577 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.417910447761194 [2024-10-24 19:02:43,577 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 4 states and 112 transitions. [2024-10-24 19:02:43,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 223 flow [2024-10-24 19:02:43,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 222 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:02:43,578 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 118 flow [2024-10-24 19:02:43,578 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-10-24 19:02:43,579 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -20 predicate places. [2024-10-24 19:02:43,580 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 118 flow [2024-10-24 19:02:43,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:43,580 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:43,580 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:02:43,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 19:02:43,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:43,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:43,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:43,785 INFO L85 PathProgramCache]: Analyzing trace with hash 943319926, now seen corresponding path program 1 times [2024-10-24 19:02:43,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:02:43,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184411395] [2024-10-24 19:02:43,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:43,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:43,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:02:43,791 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:02:43,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 19:02:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:43,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 19:02:43,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:02:43,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:43,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:02:43,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:02:43,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184411395] [2024-10-24 19:02:43,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184411395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:43,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:43,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:02:43,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318858923] [2024-10-24 19:02:43,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:43,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:02:43,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:02:43,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:02:43,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:02:43,927 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 67 [2024-10-24 19:02:43,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:43,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:43,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 67 [2024-10-24 19:02:43,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:44,151 INFO L124 PetriNetUnfolderBase]: 870/1508 cut-off events. [2024-10-24 19:02:44,151 INFO L125 PetriNetUnfolderBase]: For 357/371 co-relation queries the response was YES. [2024-10-24 19:02:44,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3371 conditions, 1508 events. 870/1508 cut-off events. For 357/371 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8335 event pairs, 36 based on Foata normal form. 56/1488 useless extension candidates. Maximal degree in co-relation 3361. Up to 829 conditions per place. [2024-10-24 19:02:44,159 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 49 selfloop transitions, 8 changer transitions 1/71 dead transitions. [2024-10-24 19:02:44,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 71 transitions, 315 flow [2024-10-24 19:02:44,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:02:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:02:44,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2024-10-24 19:02:44,161 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.417910447761194 [2024-10-24 19:02:44,161 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 118 flow. Second operand 5 states and 140 transitions. [2024-10-24 19:02:44,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 71 transitions, 315 flow [2024-10-24 19:02:44,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 71 transitions, 305 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-24 19:02:44,163 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 158 flow [2024-10-24 19:02:44,163 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-10-24 19:02:44,164 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -16 predicate places. [2024-10-24 19:02:44,164 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 158 flow [2024-10-24 19:02:44,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:44,164 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:44,165 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-10-24 19:02:44,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 19:02:44,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:44,366 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:44,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:44,366 INFO L85 PathProgramCache]: Analyzing trace with hash 580694831, now seen corresponding path program 1 times [2024-10-24 19:02:44,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:02:44,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033256507] [2024-10-24 19:02:44,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:44,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:44,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:02:44,369 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:02:44,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 19:02:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:44,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 19:02:44,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:02:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:44,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:02:44,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:02:44,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033256507] [2024-10-24 19:02:44,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033256507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:44,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:44,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:02:44,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537490052] [2024-10-24 19:02:44,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:44,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:02:44,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:02:44,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:02:44,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:02:44,505 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 67 [2024-10-24 19:02:44,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:44,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:44,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 67 [2024-10-24 19:02:44,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:44,718 INFO L124 PetriNetUnfolderBase]: 407/711 cut-off events. [2024-10-24 19:02:44,718 INFO L125 PetriNetUnfolderBase]: For 581/612 co-relation queries the response was YES. [2024-10-24 19:02:44,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1837 conditions, 711 events. 407/711 cut-off events. For 581/612 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2950 event pairs, 25 based on Foata normal form. 36/719 useless extension candidates. Maximal degree in co-relation 1825. Up to 228 conditions per place. [2024-10-24 19:02:44,722 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 44 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2024-10-24 19:02:44,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 69 transitions, 330 flow [2024-10-24 19:02:44,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:02:44,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:02:44,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2024-10-24 19:02:44,724 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38308457711442784 [2024-10-24 19:02:44,724 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 158 flow. Second operand 6 states and 154 transitions. [2024-10-24 19:02:44,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 69 transitions, 330 flow [2024-10-24 19:02:44,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 69 transitions, 305 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-24 19:02:44,728 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 172 flow [2024-10-24 19:02:44,728 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2024-10-24 19:02:44,728 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2024-10-24 19:02:44,729 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 172 flow [2024-10-24 19:02:44,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:44,729 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:44,729 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] [2024-10-24 19:02:44,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 19:02:44,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:44,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:44,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:44,931 INFO L85 PathProgramCache]: Analyzing trace with hash 984188295, now seen corresponding path program 1 times [2024-10-24 19:02:44,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:02:44,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833966094] [2024-10-24 19:02:44,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:44,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:44,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:02:44,934 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:02:44,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 19:02:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:45,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 19:02:45,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:02:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:45,223 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:02:45,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:02:45,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833966094] [2024-10-24 19:02:45,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833966094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:45,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:45,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:02:45,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008014342] [2024-10-24 19:02:45,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:45,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:02:45,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:02:45,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:02:45,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:02:45,225 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 67 [2024-10-24 19:02:45,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:45,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:45,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 67 [2024-10-24 19:02:45,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:45,331 INFO L124 PetriNetUnfolderBase]: 210/445 cut-off events. [2024-10-24 19:02:45,332 INFO L125 PetriNetUnfolderBase]: For 209/213 co-relation queries the response was YES. [2024-10-24 19:02:45,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 445 events. 210/445 cut-off events. For 209/213 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1872 event pairs, 136 based on Foata normal form. 0/411 useless extension candidates. Maximal degree in co-relation 1015. Up to 294 conditions per place. [2024-10-24 19:02:45,334 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 27 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-10-24 19:02:45,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 52 transitions, 250 flow [2024-10-24 19:02:45,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:02:45,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:02:45,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2024-10-24 19:02:45,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41044776119402987 [2024-10-24 19:02:45,336 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 172 flow. Second operand 4 states and 110 transitions. [2024-10-24 19:02:45,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 52 transitions, 250 flow [2024-10-24 19:02:45,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 194 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-10-24 19:02:45,338 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 118 flow [2024-10-24 19:02:45,338 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2024-10-24 19:02:45,339 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -19 predicate places. [2024-10-24 19:02:45,339 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 118 flow [2024-10-24 19:02:45,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:45,339 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:45,339 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] [2024-10-24 19:02:45,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 19:02:45,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:45,540 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:45,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:45,541 INFO L85 PathProgramCache]: Analyzing trace with hash 131132024, now seen corresponding path program 1 times [2024-10-24 19:02:45,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:02:45,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920942464] [2024-10-24 19:02:45,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:45,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:45,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:02:45,545 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:02:45,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 19:02:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:45,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 19:02:45,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:02:45,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:45,756 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:02:45,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:02:45,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920942464] [2024-10-24 19:02:45,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920942464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:45,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:45,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:02:45,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697942573] [2024-10-24 19:02:45,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:45,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:02:45,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:02:45,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:02:45,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:02:45,760 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 67 [2024-10-24 19:02:45,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:45,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:45,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 67 [2024-10-24 19:02:45,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:45,844 INFO L124 PetriNetUnfolderBase]: 198/425 cut-off events. [2024-10-24 19:02:45,844 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-10-24 19:02:45,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 846 conditions, 425 events. 198/425 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1790 event pairs, 124 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 837. Up to 274 conditions per place. [2024-10-24 19:02:45,846 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 26 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-10-24 19:02:45,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 51 transitions, 194 flow [2024-10-24 19:02:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:02:45,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:02:45,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-10-24 19:02:45,848 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40671641791044777 [2024-10-24 19:02:45,848 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 118 flow. Second operand 4 states and 109 transitions. [2024-10-24 19:02:45,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 51 transitions, 194 flow [2024-10-24 19:02:45,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:02:45,849 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 117 flow [2024-10-24 19:02:45,849 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2024-10-24 19:02:45,850 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -19 predicate places. [2024-10-24 19:02:45,850 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 117 flow [2024-10-24 19:02:45,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:45,850 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:45,850 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:02:45,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-24 19:02:46,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:46,051 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:46,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:46,052 INFO L85 PathProgramCache]: Analyzing trace with hash 285397695, now seen corresponding path program 1 times [2024-10-24 19:02:46,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:02:46,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250145366] [2024-10-24 19:02:46,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:46,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:46,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:02:46,054 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:02:46,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 19:02:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:46,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 19:02:46,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:02:46,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:46,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:02:46,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:02:46,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250145366] [2024-10-24 19:02:46,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250145366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:46,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:46,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:02:46,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686125827] [2024-10-24 19:02:46,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:46,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:02:46,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:02:46,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:02:46,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:02:46,229 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 67 [2024-10-24 19:02:46,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:46,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:46,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 67 [2024-10-24 19:02:46,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:46,344 INFO L124 PetriNetUnfolderBase]: 195/416 cut-off events. [2024-10-24 19:02:46,345 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-10-24 19:02:46,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 416 events. 195/416 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1852 event pairs, 180 based on Foata normal form. 8/388 useless extension candidates. Maximal degree in co-relation 843. Up to 315 conditions per place. [2024-10-24 19:02:46,352 INFO L140 encePairwiseOnDemand]: 65/67 looper letters, 17 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-10-24 19:02:46,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 41 transitions, 153 flow [2024-10-24 19:02:46,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:02:46,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:02:46,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-10-24 19:02:46,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38308457711442784 [2024-10-24 19:02:46,353 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 117 flow. Second operand 3 states and 77 transitions. [2024-10-24 19:02:46,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 41 transitions, 153 flow [2024-10-24 19:02:46,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 41 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:02:46,354 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 112 flow [2024-10-24 19:02:46,354 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2024-10-24 19:02:46,354 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -20 predicate places. [2024-10-24 19:02:46,355 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 112 flow [2024-10-24 19:02:46,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:46,355 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:46,355 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:02:46,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 19:02:46,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:46,556 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:46,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:46,557 INFO L85 PathProgramCache]: Analyzing trace with hash 929111088, now seen corresponding path program 1 times [2024-10-24 19:02:46,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:02:46,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1640421158] [2024-10-24 19:02:46,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:02:46,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:46,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:02:46,561 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:02:46,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 19:02:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:02:46,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 19:02:46,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:02:46,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:46,743 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:02:46,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:02:46,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1640421158] [2024-10-24 19:02:46,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1640421158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:46,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:46,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:02:46,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555234385] [2024-10-24 19:02:46,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:46,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:02:46,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:02:46,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:02:46,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:02:46,756 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 67 [2024-10-24 19:02:46,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 112 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:46,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:46,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 67 [2024-10-24 19:02:46,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:46,991 INFO L124 PetriNetUnfolderBase]: 442/888 cut-off events. [2024-10-24 19:02:46,991 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:02:46,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1839 conditions, 888 events. 442/888 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4604 event pairs, 83 based on Foata normal form. 8/860 useless extension candidates. Maximal degree in co-relation 1830. Up to 284 conditions per place. [2024-10-24 19:02:46,996 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 26 selfloop transitions, 3 changer transitions 17/66 dead transitions. [2024-10-24 19:02:46,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 66 transitions, 262 flow [2024-10-24 19:02:46,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:02:46,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:02:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2024-10-24 19:02:46,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3855721393034826 [2024-10-24 19:02:46,998 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 112 flow. Second operand 6 states and 155 transitions. [2024-10-24 19:02:46,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 66 transitions, 262 flow [2024-10-24 19:02:46,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 261 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:02:47,000 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 125 flow [2024-10-24 19:02:47,000 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=125, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2024-10-24 19:02:47,001 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -14 predicate places. [2024-10-24 19:02:47,001 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 125 flow [2024-10-24 19:02:47,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:47,001 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:47,001 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:02:47,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 19:02:47,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:47,206 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:47,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:47,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1403569908, now seen corresponding path program 2 times [2024-10-24 19:02:47,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:02:47,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684107465] [2024-10-24 19:02:47,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 19:02:47,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:47,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:02:47,208 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:02:47,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 19:02:47,319 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 19:02:47,320 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:02:47,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 19:02:47,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:02:47,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:02:47,366 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:02:47,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:02:47,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684107465] [2024-10-24 19:02:47,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684107465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:02:47,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:02:47,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:02:47,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167107704] [2024-10-24 19:02:47,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:02:47,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:02:47,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:02:47,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:02:47,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:02:47,374 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 67 [2024-10-24 19:02:47,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:47,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:02:47,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 67 [2024-10-24 19:02:47,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:02:47,562 INFO L124 PetriNetUnfolderBase]: 398/832 cut-off events. [2024-10-24 19:02:47,562 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-24 19:02:47,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1740 conditions, 832 events. 398/832 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4359 event pairs, 165 based on Foata normal form. 8/792 useless extension candidates. Maximal degree in co-relation 1727. Up to 233 conditions per place. [2024-10-24 19:02:47,571 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 26 selfloop transitions, 3 changer transitions 19/68 dead transitions. [2024-10-24 19:02:47,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 287 flow [2024-10-24 19:02:47,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:02:47,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:02:47,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2024-10-24 19:02:47,572 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39054726368159204 [2024-10-24 19:02:47,572 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 125 flow. Second operand 6 states and 157 transitions. [2024-10-24 19:02:47,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 287 flow [2024-10-24 19:02:47,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 68 transitions, 271 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-24 19:02:47,574 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 127 flow [2024-10-24 19:02:47,574 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=127, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2024-10-24 19:02:47,575 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2024-10-24 19:02:47,575 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 127 flow [2024-10-24 19:02:47,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:02:47,577 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:02:47,577 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:02:47,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-24 19:02:47,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:47,778 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-24 19:02:47,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:02:47,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1631609138, now seen corresponding path program 3 times [2024-10-24 19:02:47,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:02:47,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044128249] [2024-10-24 19:02:47,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 19:02:47,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:47,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:02:47,781 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:02:47,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 19:02:47,891 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-24 19:02:47,891 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-24 19:02:47,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 19:02:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:02:48,086 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 19:02:48,086 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 19:02:48,091 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (46 of 47 remaining) [2024-10-24 19:02:48,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 47 remaining) [2024-10-24 19:02:48,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 47 remaining) [2024-10-24 19:02:48,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 47 remaining) [2024-10-24 19:02:48,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 47 remaining) [2024-10-24 19:02:48,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 47 remaining) [2024-10-24 19:02:48,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 47 remaining) [2024-10-24 19:02:48,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 47 remaining) [2024-10-24 19:02:48,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 47 remaining) [2024-10-24 19:02:48,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 47 remaining) [2024-10-24 19:02:48,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 47 remaining) [2024-10-24 19:02:48,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 47 remaining) [2024-10-24 19:02:48,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 47 remaining) [2024-10-24 19:02:48,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 47 remaining) [2024-10-24 19:02:48,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 47 remaining) [2024-10-24 19:02:48,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 47 remaining) [2024-10-24 19:02:48,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 47 remaining) [2024-10-24 19:02:48,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 47 remaining) [2024-10-24 19:02:48,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 47 remaining) [2024-10-24 19:02:48,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 47 remaining) [2024-10-24 19:02:48,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 47 remaining) [2024-10-24 19:02:48,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 47 remaining) [2024-10-24 19:02:48,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 47 remaining) [2024-10-24 19:02:48,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 47 remaining) [2024-10-24 19:02:48,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 47 remaining) [2024-10-24 19:02:48,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (21 of 47 remaining) [2024-10-24 19:02:48,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 47 remaining) [2024-10-24 19:02:48,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 47 remaining) [2024-10-24 19:02:48,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 47 remaining) [2024-10-24 19:02:48,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 47 remaining) [2024-10-24 19:02:48,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 47 remaining) [2024-10-24 19:02:48,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 47 remaining) [2024-10-24 19:02:48,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 47 remaining) [2024-10-24 19:02:48,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 47 remaining) [2024-10-24 19:02:48,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 47 remaining) [2024-10-24 19:02:48,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 47 remaining) [2024-10-24 19:02:48,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 47 remaining) [2024-10-24 19:02:48,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 47 remaining) [2024-10-24 19:02:48,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 47 remaining) [2024-10-24 19:02:48,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 47 remaining) [2024-10-24 19:02:48,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 47 remaining) [2024-10-24 19:02:48,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 47 remaining) [2024-10-24 19:02:48,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 47 remaining) [2024-10-24 19:02:48,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 47 remaining) [2024-10-24 19:02:48,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 47 remaining) [2024-10-24 19:02:48,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 47 remaining) [2024-10-24 19:02:48,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 47 remaining) [2024-10-24 19:02:48,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-24 19:02:48,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:02:48,302 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:02:48,488 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 19:02:48,488 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 19:02:48,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:02:48 BasicIcfg [2024-10-24 19:02:48,496 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 19:02:48,496 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 19:02:48,496 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 19:02:48,497 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 19:02:48,497 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:02:41" (3/4) ... [2024-10-24 19:02:48,503 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 19:02:48,504 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 19:02:48,505 INFO L158 Benchmark]: Toolchain (without parser) took 8851.32ms. Allocated memory was 81.8MB in the beginning and 310.4MB in the end (delta: 228.6MB). Free memory was 43.4MB in the beginning and 256.5MB in the end (delta: -213.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 19:02:48,505 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 81.8MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:02:48,505 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.29ms. Allocated memory is still 81.8MB. Free memory was 43.1MB in the beginning and 40.8MB in the end (delta: 2.4MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2024-10-24 19:02:48,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.13ms. Allocated memory is still 81.8MB. Free memory was 40.8MB in the beginning and 38.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 19:02:48,509 INFO L158 Benchmark]: Boogie Preprocessor took 67.34ms. Allocated memory was 81.8MB in the beginning and 151.0MB in the end (delta: 69.2MB). Free memory was 38.1MB in the beginning and 128.3MB in the end (delta: -90.2MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-10-24 19:02:48,509 INFO L158 Benchmark]: RCFGBuilder took 1046.75ms. Allocated memory is still 151.0MB. Free memory was 128.3MB in the beginning and 72.5MB in the end (delta: 55.8MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. [2024-10-24 19:02:48,509 INFO L158 Benchmark]: TraceAbstraction took 7175.43ms. Allocated memory was 151.0MB in the beginning and 310.4MB in the end (delta: 159.4MB). Free memory was 71.5MB in the beginning and 256.5MB in the end (delta: -185.0MB). Peak memory consumption was 134.8MB. Max. memory is 16.1GB. [2024-10-24 19:02:48,509 INFO L158 Benchmark]: Witness Printer took 7.93ms. Allocated memory is still 310.4MB. Free memory is still 256.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:02:48,512 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 81.8MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 487.29ms. Allocated memory is still 81.8MB. Free memory was 43.1MB in the beginning and 40.8MB in the end (delta: 2.4MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.13ms. Allocated memory is still 81.8MB. Free memory was 40.8MB in the beginning and 38.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.34ms. Allocated memory was 81.8MB in the beginning and 151.0MB in the end (delta: 69.2MB). Free memory was 38.1MB in the beginning and 128.3MB in the end (delta: -90.2MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1046.75ms. Allocated memory is still 151.0MB. Free memory was 128.3MB in the beginning and 72.5MB in the end (delta: 55.8MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7175.43ms. Allocated memory was 151.0MB in the beginning and 310.4MB in the end (delta: 159.4MB). Free memory was 71.5MB in the beginning and 256.5MB in the end (delta: -185.0MB). Peak memory consumption was 134.8MB. Max. memory is 16.1GB. * Witness Printer took 7.93ms. Allocated memory is still 310.4MB. Free memory is still 256.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1949; [L837] FCALL, FORK 0 pthread_create(&t1949, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1949=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] EXPR 1 \read(z) [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L769] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L770] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L771] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L773] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L776] EXPR 1 \read(z) [L776] 1 __unbuffered_p0_EAX = z [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] EXPR 1 \read(z) [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] 1 z = z$flush_delayed ? z$mem_tmp : z [L778] 1 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L838] 0 pthread_t t1950; [L839] FCALL, FORK 0 pthread_create(&t1950, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1949=0, t1950=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L840] 0 pthread_t t1951; [L841] FCALL, FORK 0 pthread_create(&t1951, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1949=0, t1950=1, t1951=2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L781] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L793] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L796] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L808] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L811] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 \read(z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1949=0, t1950=1, t1951=2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 \read(z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1949=0, t1950=1, t1951=2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L854] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1949=0, t1950=1, t1951=2, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L18] 0 __assert_fail ("0", "safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - 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: -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: -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: -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: -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: -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: -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: -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: -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: -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: -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: -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: 834]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 839]: 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: 841]: 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: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 108 locations, 47 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: 6.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 334 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 319 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 727 IncrementalHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 5 mSDtfsCounter, 727 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=5, InterpolantAutomatonStates: 44, 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, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 1020 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1368 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 19:02:48,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample