./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/safe027_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d 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/safe027_power.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9d301fd24d7dbc3684a100e80ac453023513d8631f488025251adcc1a8646b5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:24:35,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:24:35,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:24:35,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:24:35,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:24:35,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:24:35,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:24:35,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:24:35,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:24:35,476 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:24:35,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:24:35,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:24:35,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:24:35,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:24:35,479 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:24:35,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:24:35,483 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:24:35,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:24:35,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:24:35,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:24:35,485 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:24:35,485 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:24:35,486 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:24:35,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:24:35,486 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:24:35,486 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:24:35,486 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:24:35,487 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:24:35,487 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:24:35,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:24:35,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:24:35,488 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:24:35,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:24:35,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:24:35,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:24:35,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:24:35,492 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:24:35,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:24:35,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:24:35,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:24:35,493 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:24:35,493 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:24:35,494 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 -> a9d301fd24d7dbc3684a100e80ac453023513d8631f488025251adcc1a8646b5 [2024-10-13 12:24:35,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:24:35,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:24:35,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:24:35,800 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:24:35,801 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:24:35,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i [2024-10-13 12:24:37,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:24:37,768 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:24:37,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i [2024-10-13 12:24:37,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/596e9dba9/207146d02e114fee90e0de720432800c/FLAG52f615455 [2024-10-13 12:24:37,807 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/596e9dba9/207146d02e114fee90e0de720432800c [2024-10-13 12:24:37,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:24:37,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:24:37,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:24:37,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:24:37,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:24:37,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:24:37" (1/1) ... [2024-10-13 12:24:37,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a6e57fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:37, skipping insertion in model container [2024-10-13 12:24:37,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:24:37" (1/1) ... [2024-10-13 12:24:37,869 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:24:38,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:24:38,366 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:24:38,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:24:38,510 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:24:38,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:38 WrapperNode [2024-10-13 12:24:38,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:24:38,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:24:38,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:24:38,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:24:38,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:38" (1/1) ... [2024-10-13 12:24:38,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:38" (1/1) ... [2024-10-13 12:24:38,591 INFO L138 Inliner]: procedures = 176, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2024-10-13 12:24:38,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:24:38,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:24:38,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:24:38,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:24:38,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:38" (1/1) ... [2024-10-13 12:24:38,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:38" (1/1) ... [2024-10-13 12:24:38,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:38" (1/1) ... [2024-10-13 12:24:38,651 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 7 writes are split as follows [0, 7]. [2024-10-13 12:24:38,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:38" (1/1) ... [2024-10-13 12:24:38,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:38" (1/1) ... [2024-10-13 12:24:38,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:38" (1/1) ... [2024-10-13 12:24:38,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:38" (1/1) ... [2024-10-13 12:24:38,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:38" (1/1) ... [2024-10-13 12:24:38,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:38" (1/1) ... [2024-10-13 12:24:38,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:24:38,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:24:38,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:24:38,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:24:38,691 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:38" (1/1) ... [2024-10-13 12:24:38,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:24:38,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:24:38,732 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-13 12:24:38,734 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-13 12:24:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 12:24:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 12:24:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 12:24:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 12:24:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:24:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:24:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-13 12:24:38,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-13 12:24:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-13 12:24:38,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-13 12:24:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-13 12:24:38,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-13 12:24:38,780 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-13 12:24:38,780 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-13 12:24:38,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:24:38,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 12:24:38,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:24:38,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:24:38,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:24:38,782 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:24:38,937 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:24:38,938 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:24:39,593 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:24:39,593 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:24:40,331 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:24:40,332 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 12:24:40,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:24:40 BoogieIcfgContainer [2024-10-13 12:24:40,332 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:24:40,334 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:24:40,335 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:24:40,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:24:40,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:24:37" (1/3) ... [2024-10-13 12:24:40,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea72256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:24:40, skipping insertion in model container [2024-10-13 12:24:40,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:38" (2/3) ... [2024-10-13 12:24:40,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea72256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:24:40, skipping insertion in model container [2024-10-13 12:24:40,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:24:40" (3/3) ... [2024-10-13 12:24:40,341 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.oepc.i [2024-10-13 12:24:40,359 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:24:40,360 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2024-10-13 12:24:40,360 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:24:40,524 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:24:40,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 90 transitions, 196 flow [2024-10-13 12:24:40,619 INFO L124 PetriNetUnfolderBase]: 2/86 cut-off events. [2024-10-13 12:24:40,620 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:24:40,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 2/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 327 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2024-10-13 12:24:40,631 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 90 transitions, 196 flow [2024-10-13 12:24:40,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 86 transitions, 184 flow [2024-10-13 12:24:40,649 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:24:40,658 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;@6dac7be8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:24:40,659 INFO L334 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2024-10-13 12:24:40,663 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:24:40,664 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-13 12:24:40,664 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:24:40,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:24:40,665 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-13 12:24:40,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:24:40,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:24:40,671 INFO L85 PathProgramCache]: Analyzing trace with hash 26834807, now seen corresponding path program 1 times [2024-10-13 12:24:40,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:24:40,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075918254] [2024-10-13 12:24:40,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:24:40,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:24:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:24:41,068 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-13 12:24:41,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:24:41,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075918254] [2024-10-13 12:24:41,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075918254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:24:41,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:24:41,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:24:41,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727717299] [2024-10-13 12:24:41,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:24:41,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:24:41,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:24:41,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:24:41,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:24:41,126 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 90 [2024-10-13 12:24:41,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 86 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-13 12:24:41,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:24:41,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 90 [2024-10-13 12:24:41,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:24:44,057 INFO L124 PetriNetUnfolderBase]: 8251/12424 cut-off events. [2024-10-13 12:24:44,058 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:24:44,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23772 conditions, 12424 events. 8251/12424 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1093. Compared 98942 event pairs, 8251 based on Foata normal form. 448/9182 useless extension candidates. Maximal degree in co-relation 23760. Up to 11252 conditions per place. [2024-10-13 12:24:44,207 INFO L140 encePairwiseOnDemand]: 56/90 looper letters, 32 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2024-10-13 12:24:44,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 52 transitions, 182 flow [2024-10-13 12:24:44,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:24:44,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:24:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2024-10-13 12:24:44,221 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-10-13 12:24:44,223 INFO L175 Difference]: Start difference. First operand has 97 places, 86 transitions, 184 flow. Second operand 3 states and 135 transitions. [2024-10-13 12:24:44,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 52 transitions, 182 flow [2024-10-13 12:24:44,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 52 transitions, 178 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 12:24:44,237 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 114 flow [2024-10-13 12:24:44,239 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2024-10-13 12:24:44,244 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -34 predicate places. [2024-10-13 12:24:44,244 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 114 flow [2024-10-13 12:24:44,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-13 12:24:44,245 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:24:44,246 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-13 12:24:44,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:24:44,246 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:24:44,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:24:44,247 INFO L85 PathProgramCache]: Analyzing trace with hash 26834808, now seen corresponding path program 1 times [2024-10-13 12:24:44,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:24:44,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637622074] [2024-10-13 12:24:44,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:24:44,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:24:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:24:44,428 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-13 12:24:44,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:24:44,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637622074] [2024-10-13 12:24:44,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637622074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:24:44,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:24:44,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:24:44,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520439428] [2024-10-13 12:24:44,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:24:44,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:24:44,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:24:44,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:24:44,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:24:44,433 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 90 [2024-10-13 12:24:44,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-13 12:24:44,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:24:44,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 90 [2024-10-13 12:24:44,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:24:45,439 INFO L124 PetriNetUnfolderBase]: 2059/3342 cut-off events. [2024-10-13 12:24:45,439 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:24:45,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6308 conditions, 3342 events. 2059/3342 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 24173 event pairs, 2059 based on Foata normal form. 0/3158 useless extension candidates. Maximal degree in co-relation 6302. Up to 2906 conditions per place. [2024-10-13 12:24:45,469 INFO L140 encePairwiseOnDemand]: 82/90 looper letters, 24 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2024-10-13 12:24:45,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 152 flow [2024-10-13 12:24:45,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:24:45,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:24:45,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-10-13 12:24:45,472 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2024-10-13 12:24:45,472 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 114 flow. Second operand 3 states and 102 transitions. [2024-10-13 12:24:45,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 152 flow [2024-10-13 12:24:45,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 45 transitions, 151 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:24:45,474 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 99 flow [2024-10-13 12:24:45,474 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=55, 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=99, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2024-10-13 12:24:45,475 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -40 predicate places. [2024-10-13 12:24:45,475 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 99 flow [2024-10-13 12:24:45,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-13 12:24:45,476 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:24:45,476 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:24:45,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:24:45,477 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:24:45,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:24:45,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1657825990, now seen corresponding path program 1 times [2024-10-13 12:24:45,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:24:45,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374372269] [2024-10-13 12:24:45,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:24:45,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:24:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:24:45,636 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-13 12:24:45,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:24:45,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374372269] [2024-10-13 12:24:45,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374372269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:24:45,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:24:45,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:24:45,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337211635] [2024-10-13 12:24:45,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:24:45,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:24:45,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:24:45,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:24:45,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:24:45,640 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 90 [2024-10-13 12:24:45,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:24:45,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:24:45,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 90 [2024-10-13 12:24:45,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:24:46,376 INFO L124 PetriNetUnfolderBase]: 1733/3235 cut-off events. [2024-10-13 12:24:46,377 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:24:46,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5756 conditions, 3235 events. 1733/3235 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 25271 event pairs, 409 based on Foata normal form. 0/3076 useless extension candidates. Maximal degree in co-relation 5749. Up to 1889 conditions per place. [2024-10-13 12:24:46,402 INFO L140 encePairwiseOnDemand]: 86/90 looper letters, 42 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-10-13 12:24:46,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 63 transitions, 231 flow [2024-10-13 12:24:46,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:24:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:24:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2024-10-13 12:24:46,407 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2024-10-13 12:24:46,408 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 99 flow. Second operand 3 states and 115 transitions. [2024-10-13 12:24:46,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 63 transitions, 231 flow [2024-10-13 12:24:46,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 63 transitions, 230 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:24:46,411 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 108 flow [2024-10-13 12:24:46,412 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2024-10-13 12:24:46,413 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -39 predicate places. [2024-10-13 12:24:46,413 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 108 flow [2024-10-13 12:24:46,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:24:46,414 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:24:46,414 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:24:46,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:24:46,415 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:24:46,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:24:46,416 INFO L85 PathProgramCache]: Analyzing trace with hash 262158985, now seen corresponding path program 1 times [2024-10-13 12:24:46,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:24:46,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876642200] [2024-10-13 12:24:46,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:24:46,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:24:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:24:46,604 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-13 12:24:46,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:24:46,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876642200] [2024-10-13 12:24:46,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876642200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:24:46,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:24:46,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:24:46,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538343013] [2024-10-13 12:24:46,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:24:46,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:24:46,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:24:46,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:24:46,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:24:46,613 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 90 [2024-10-13 12:24:46,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:24:46,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:24:46,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 90 [2024-10-13 12:24:46,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:24:47,443 INFO L124 PetriNetUnfolderBase]: 1617/3071 cut-off events. [2024-10-13 12:24:47,447 INFO L125 PetriNetUnfolderBase]: For 234/234 co-relation queries the response was YES. [2024-10-13 12:24:47,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5898 conditions, 3071 events. 1617/3071 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 23917 event pairs, 385 based on Foata normal form. 0/3032 useless extension candidates. Maximal degree in co-relation 5889. Up to 1724 conditions per place. [2024-10-13 12:24:47,474 INFO L140 encePairwiseOnDemand]: 87/90 looper letters, 41 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2024-10-13 12:24:47,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 234 flow [2024-10-13 12:24:47,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:24:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:24:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2024-10-13 12:24:47,477 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2024-10-13 12:24:47,477 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 108 flow. Second operand 4 states and 136 transitions. [2024-10-13 12:24:47,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 234 flow [2024-10-13 12:24:47,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 62 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:24:47,480 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 104 flow [2024-10-13 12:24:47,480 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, 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=104, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2024-10-13 12:24:47,481 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -39 predicate places. [2024-10-13 12:24:47,481 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 104 flow [2024-10-13 12:24:47,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:24:47,481 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:24:47,482 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:24:47,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 12:24:47,482 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:24:47,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:24:47,483 INFO L85 PathProgramCache]: Analyzing trace with hash 262158986, now seen corresponding path program 1 times [2024-10-13 12:24:47,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:24:47,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901948113] [2024-10-13 12:24:47,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:24:47,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:24:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:24:47,884 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-13 12:24:47,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:24:47,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901948113] [2024-10-13 12:24:47,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901948113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:24:47,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:24:47,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:24:47,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120846851] [2024-10-13 12:24:47,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:24:47,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:24:47,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:24:47,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:24:47,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:24:47,891 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 90 [2024-10-13 12:24:47,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:24:47,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:24:47,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 90 [2024-10-13 12:24:47,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:24:48,474 INFO L124 PetriNetUnfolderBase]: 1501/2907 cut-off events. [2024-10-13 12:24:48,474 INFO L125 PetriNetUnfolderBase]: For 234/234 co-relation queries the response was YES. [2024-10-13 12:24:48,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5522 conditions, 2907 events. 1501/2907 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 22706 event pairs, 361 based on Foata normal form. 48/2940 useless extension candidates. Maximal degree in co-relation 5513. Up to 1560 conditions per place. [2024-10-13 12:24:48,495 INFO L140 encePairwiseOnDemand]: 87/90 looper letters, 40 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2024-10-13 12:24:48,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 61 transitions, 228 flow [2024-10-13 12:24:48,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:24:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:24:48,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2024-10-13 12:24:48,498 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-10-13 12:24:48,538 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 104 flow. Second operand 4 states and 135 transitions. [2024-10-13 12:24:48,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 61 transitions, 228 flow [2024-10-13 12:24:48,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 61 transitions, 223 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:24:48,542 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 99 flow [2024-10-13 12:24:48,542 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=54, 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=99, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2024-10-13 12:24:48,544 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -40 predicate places. [2024-10-13 12:24:48,545 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 99 flow [2024-10-13 12:24:48,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:24:48,546 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:24:48,546 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:24:48,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:24:48,549 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:24:48,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:24:48,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1505046308, now seen corresponding path program 1 times [2024-10-13 12:24:48,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:24:48,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302424014] [2024-10-13 12:24:48,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:24:48,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:24:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:24:48,612 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-13 12:24:48,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:24:48,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302424014] [2024-10-13 12:24:48,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302424014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:24:48,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:24:48,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:24:48,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344776709] [2024-10-13 12:24:48,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:24:48,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:24:48,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:24:48,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:24:48,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:24:48,618 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 90 [2024-10-13 12:24:48,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:24:48,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:24:48,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 90 [2024-10-13 12:24:48,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:24:49,053 INFO L124 PetriNetUnfolderBase]: 1501/2496 cut-off events. [2024-10-13 12:24:49,054 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2024-10-13 12:24:49,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5110 conditions, 2496 events. 1501/2496 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 17636 event pairs, 1501 based on Foata normal form. 72/2528 useless extension candidates. Maximal degree in co-relation 5102. Up to 2132 conditions per place. [2024-10-13 12:24:49,071 INFO L140 encePairwiseOnDemand]: 88/90 looper letters, 21 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-10-13 12:24:49,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 41 transitions, 143 flow [2024-10-13 12:24:49,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:24:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:24:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-10-13 12:24:49,073 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-10-13 12:24:49,073 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 99 flow. Second operand 3 states and 90 transitions. [2024-10-13 12:24:49,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 41 transitions, 143 flow [2024-10-13 12:24:49,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 41 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:24:49,075 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 94 flow [2024-10-13 12:24:49,075 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=54, 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=94, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2024-10-13 12:24:49,075 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -41 predicate places. [2024-10-13 12:24:49,076 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 94 flow [2024-10-13 12:24:49,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:24:49,076 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:24:49,076 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:24:49,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 12:24:49,076 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:24:49,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:24:49,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1505047709, now seen corresponding path program 1 times [2024-10-13 12:24:49,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:24:49,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942434593] [2024-10-13 12:24:49,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:24:49,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:24:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:24:49,237 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-13 12:24:49,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:24:49,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942434593] [2024-10-13 12:24:49,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942434593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:24:49,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:24:49,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:24:49,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252726529] [2024-10-13 12:24:49,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:24:49,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:24:49,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:24:49,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:24:49,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:24:49,248 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 90 [2024-10-13 12:24:49,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:24:49,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:24:49,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 90 [2024-10-13 12:24:49,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:24:50,970 INFO L124 PetriNetUnfolderBase]: 5901/8821 cut-off events. [2024-10-13 12:24:50,970 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:24:50,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18147 conditions, 8821 events. 5901/8821 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 57410 event pairs, 655 based on Foata normal form. 240/9046 useless extension candidates. Maximal degree in co-relation 18139. Up to 5353 conditions per place. [2024-10-13 12:24:51,038 INFO L140 encePairwiseOnDemand]: 83/90 looper letters, 48 selfloop transitions, 6 changer transitions 1/68 dead transitions. [2024-10-13 12:24:51,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 270 flow [2024-10-13 12:24:51,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:24:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:24:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2024-10-13 12:24:51,040 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2024-10-13 12:24:51,041 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 94 flow. Second operand 4 states and 129 transitions. [2024-10-13 12:24:51,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 270 flow [2024-10-13 12:24:51,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 269 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:24:51,042 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 135 flow [2024-10-13 12:24:51,043 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2024-10-13 12:24:51,046 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -38 predicate places. [2024-10-13 12:24:51,046 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 135 flow [2024-10-13 12:24:51,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:24:51,047 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:24:51,047 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-13 12:24:51,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 12:24:51,048 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:24:51,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:24:51,048 INFO L85 PathProgramCache]: Analyzing trace with hash -145207579, now seen corresponding path program 1 times [2024-10-13 12:24:51,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:24:51,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530556827] [2024-10-13 12:24:51,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:24:51,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:24:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:24:51,243 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-13 12:24:51,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:24:51,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530556827] [2024-10-13 12:24:51,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530556827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:24:51,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:24:51,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:24:51,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456756127] [2024-10-13 12:24:51,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:24:51,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:24:51,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:24:51,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:24:51,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:24:51,253 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 90 [2024-10-13 12:24:51,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-13 12:24:51,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:24:51,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 90 [2024-10-13 12:24:51,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:24:52,375 INFO L124 PetriNetUnfolderBase]: 4733/7137 cut-off events. [2024-10-13 12:24:52,375 INFO L125 PetriNetUnfolderBase]: For 1820/1820 co-relation queries the response was YES. [2024-10-13 12:24:52,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17134 conditions, 7137 events. 4733/7137 cut-off events. For 1820/1820 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 44861 event pairs, 245 based on Foata normal form. 228/7350 useless extension candidates. Maximal degree in co-relation 17123. Up to 3841 conditions per place. [2024-10-13 12:24:52,433 INFO L140 encePairwiseOnDemand]: 83/90 looper letters, 61 selfloop transitions, 10 changer transitions 1/85 dead transitions. [2024-10-13 12:24:52,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 85 transitions, 396 flow [2024-10-13 12:24:52,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:24:52,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:24:52,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2024-10-13 12:24:52,435 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.36444444444444446 [2024-10-13 12:24:52,435 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 135 flow. Second operand 5 states and 164 transitions. [2024-10-13 12:24:52,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 85 transitions, 396 flow [2024-10-13 12:24:52,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 85 transitions, 385 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-13 12:24:52,446 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 187 flow [2024-10-13 12:24:52,447 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2024-10-13 12:24:52,447 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -34 predicate places. [2024-10-13 12:24:52,449 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 187 flow [2024-10-13 12:24:52,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-13 12:24:52,449 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:24:52,450 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-13 12:24:52,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 12:24:52,450 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:24:52,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:24:52,450 INFO L85 PathProgramCache]: Analyzing trace with hash 519297639, now seen corresponding path program 1 times [2024-10-13 12:24:52,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:24:52,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752346554] [2024-10-13 12:24:52,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:24:52,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:24:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:24:52,734 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-13 12:24:52,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:24:52,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752346554] [2024-10-13 12:24:52,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752346554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:24:52,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:24:52,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:24:52,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723510195] [2024-10-13 12:24:52,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:24:52,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:24:52,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:24:52,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:24:52,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:24:52,752 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 90 [2024-10-13 12:24:52,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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-13 12:24:52,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:24:52,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 90 [2024-10-13 12:24:52,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:24:53,410 INFO L124 PetriNetUnfolderBase]: 2973/4493 cut-off events. [2024-10-13 12:24:53,411 INFO L125 PetriNetUnfolderBase]: For 3380/3380 co-relation queries the response was YES. [2024-10-13 12:24:53,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12052 conditions, 4493 events. 2973/4493 cut-off events. For 3380/3380 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 24804 event pairs, 111 based on Foata normal form. 172/4650 useless extension candidates. Maximal degree in co-relation 12039. Up to 1633 conditions per place. [2024-10-13 12:24:53,444 INFO L140 encePairwiseOnDemand]: 83/90 looper letters, 72 selfloop transitions, 14 changer transitions 1/100 dead transitions. [2024-10-13 12:24:53,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 100 transitions, 521 flow [2024-10-13 12:24:53,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:24:53,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:24:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 197 transitions. [2024-10-13 12:24:53,446 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3648148148148148 [2024-10-13 12:24:53,446 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 187 flow. Second operand 6 states and 197 transitions. [2024-10-13 12:24:53,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 100 transitions, 521 flow [2024-10-13 12:24:53,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 100 transitions, 491 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-13 12:24:53,459 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 237 flow [2024-10-13 12:24:53,459 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2024-10-13 12:24:53,460 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -31 predicate places. [2024-10-13 12:24:53,460 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 237 flow [2024-10-13 12:24:53,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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-13 12:24:53,460 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:24:53,461 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-13 12:24:53,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 12:24:53,461 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:24:53,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:24:53,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1446307797, now seen corresponding path program 1 times [2024-10-13 12:24:53,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:24:53,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029761283] [2024-10-13 12:24:53,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:24:53,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:24:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:24:53,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:24:53,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:24:53,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029761283] [2024-10-13 12:24:53,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029761283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:24:53,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:24:53,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:24:53,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171462482] [2024-10-13 12:24:53,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:24:53,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:24:53,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:24:53,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:24:53,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:24:53,941 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 90 [2024-10-13 12:24:53,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 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-13 12:24:53,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:24:53,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 90 [2024-10-13 12:24:53,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:24:54,503 INFO L124 PetriNetUnfolderBase]: 1801/2653 cut-off events. [2024-10-13 12:24:54,504 INFO L125 PetriNetUnfolderBase]: For 3560/3560 co-relation queries the response was YES. [2024-10-13 12:24:54,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8013 conditions, 2653 events. 1801/2653 cut-off events. For 3560/3560 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 12675 event pairs, 73 based on Foata normal form. 80/2718 useless extension candidates. Maximal degree in co-relation 7999. Up to 796 conditions per place. [2024-10-13 12:24:54,520 INFO L140 encePairwiseOnDemand]: 83/90 looper letters, 65 selfloop transitions, 18 changer transitions 1/97 dead transitions. [2024-10-13 12:24:54,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 97 transitions, 517 flow [2024-10-13 12:24:54,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:24:54,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:24:54,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 212 transitions. [2024-10-13 12:24:54,522 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.33650793650793653 [2024-10-13 12:24:54,522 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 237 flow. Second operand 7 states and 212 transitions. [2024-10-13 12:24:54,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 97 transitions, 517 flow [2024-10-13 12:24:54,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 97 transitions, 471 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-10-13 12:24:54,540 INFO L231 Difference]: Finished difference. Result has 69 places, 52 transitions, 247 flow [2024-10-13 12:24:54,540 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=247, PETRI_PLACES=69, PETRI_TRANSITIONS=52} [2024-10-13 12:24:54,541 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -28 predicate places. [2024-10-13 12:24:54,541 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 52 transitions, 247 flow [2024-10-13 12:24:54,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 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-13 12:24:54,542 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:24:54,542 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, 1, 1, 1, 1, 1] [2024-10-13 12:24:54,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 12:24:54,542 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:24:54,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:24:54,544 INFO L85 PathProgramCache]: Analyzing trace with hash -121600130, now seen corresponding path program 1 times [2024-10-13 12:24:54,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:24:54,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886959453] [2024-10-13 12:24:54,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:24:54,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:24:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:24:55,058 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-13 12:24:55,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:24:55,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886959453] [2024-10-13 12:24:55,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886959453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:24:55,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:24:55,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:24:55,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253974650] [2024-10-13 12:24:55,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:24:55,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:24:55,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:24:55,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:24:55,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:24:55,072 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 90 [2024-10-13 12:24:55,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 52 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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-13 12:24:55,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:24:55,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 90 [2024-10-13 12:24:55,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:24:55,674 INFO L124 PetriNetUnfolderBase]: 2193/3825 cut-off events. [2024-10-13 12:24:55,674 INFO L125 PetriNetUnfolderBase]: For 2233/2327 co-relation queries the response was YES. [2024-10-13 12:24:55,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9389 conditions, 3825 events. 2193/3825 cut-off events. For 2233/2327 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 24714 event pairs, 698 based on Foata normal form. 16/3639 useless extension candidates. Maximal degree in co-relation 9374. Up to 1477 conditions per place. [2024-10-13 12:24:55,705 INFO L140 encePairwiseOnDemand]: 85/90 looper letters, 34 selfloop transitions, 1 changer transitions 26/89 dead transitions. [2024-10-13 12:24:55,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 89 transitions, 463 flow [2024-10-13 12:24:55,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:24:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:24:55,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 188 transitions. [2024-10-13 12:24:55,707 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.34814814814814815 [2024-10-13 12:24:55,707 INFO L175 Difference]: Start difference. First operand has 69 places, 52 transitions, 247 flow. Second operand 6 states and 188 transitions. [2024-10-13 12:24:55,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 89 transitions, 463 flow [2024-10-13 12:24:55,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 357 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-10-13 12:24:55,728 INFO L231 Difference]: Finished difference. Result has 68 places, 52 transitions, 162 flow [2024-10-13 12:24:55,732 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=68, PETRI_TRANSITIONS=52} [2024-10-13 12:24:55,732 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -29 predicate places. [2024-10-13 12:24:55,733 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 52 transitions, 162 flow [2024-10-13 12:24:55,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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-13 12:24:55,733 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:24:55,733 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, 1, 1, 1, 1, 1] [2024-10-13 12:24:55,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 12:24:55,734 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:24:55,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:24:55,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1788529608, now seen corresponding path program 2 times [2024-10-13 12:24:55,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:24:55,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605737907] [2024-10-13 12:24:55,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:24:55,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:24:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:24:57,869 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-13 12:24:57,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:24:57,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605737907] [2024-10-13 12:24:57,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605737907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:24:57,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:24:57,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 12:24:57,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417215986] [2024-10-13 12:24:57,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:24:57,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:24:57,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:24:57,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:24:57,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:24:57,882 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 90 [2024-10-13 12:24:57,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 52 transitions, 162 flow. Second operand has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 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-13 12:24:57,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:24:57,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 90 [2024-10-13 12:24:57,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:24:58,597 INFO L124 PetriNetUnfolderBase]: 1942/3495 cut-off events. [2024-10-13 12:24:58,598 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-10-13 12:24:58,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7174 conditions, 3495 events. 1942/3495 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 23448 event pairs, 354 based on Foata normal form. 16/3272 useless extension candidates. Maximal degree in co-relation 7161. Up to 907 conditions per place. [2024-10-13 12:24:58,619 INFO L140 encePairwiseOnDemand]: 82/90 looper letters, 53 selfloop transitions, 9 changer transitions 12/104 dead transitions. [2024-10-13 12:24:58,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 104 transitions, 430 flow [2024-10-13 12:24:58,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 12:24:58,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 12:24:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 282 transitions. [2024-10-13 12:24:58,621 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.34814814814814815 [2024-10-13 12:24:58,621 INFO L175 Difference]: Start difference. First operand has 68 places, 52 transitions, 162 flow. Second operand 9 states and 282 transitions. [2024-10-13 12:24:58,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 104 transitions, 430 flow [2024-10-13 12:24:58,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 104 transitions, 417 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-10-13 12:24:58,626 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 218 flow [2024-10-13 12:24:58,626 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=218, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2024-10-13 12:24:58,628 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -22 predicate places. [2024-10-13 12:24:58,628 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 218 flow [2024-10-13 12:24:58,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 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-13 12:24:58,629 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:24:58,629 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, 1, 1, 1, 1, 1] [2024-10-13 12:24:58,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 12:24:58,630 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:24:58,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:24:58,630 INFO L85 PathProgramCache]: Analyzing trace with hash -354301916, now seen corresponding path program 3 times [2024-10-13 12:24:58,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:24:58,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728969632] [2024-10-13 12:24:58,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:24:58,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:24:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:24:59,013 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-13 12:24:59,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:24:59,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728969632] [2024-10-13 12:24:59,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728969632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:24:59,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:24:59,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:24:59,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688782151] [2024-10-13 12:24:59,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:24:59,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:24:59,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:24:59,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:24:59,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:24:59,034 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 90 [2024-10-13 12:24:59,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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-13 12:24:59,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:24:59,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 90 [2024-10-13 12:24:59,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:00,051 INFO L124 PetriNetUnfolderBase]: 5046/8881 cut-off events. [2024-10-13 12:25:00,052 INFO L125 PetriNetUnfolderBase]: For 2440/2440 co-relation queries the response was YES. [2024-10-13 12:25:00,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20271 conditions, 8881 events. 5046/8881 cut-off events. For 2440/2440 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 68711 event pairs, 995 based on Foata normal form. 16/8261 useless extension candidates. Maximal degree in co-relation 20254. Up to 3195 conditions per place. [2024-10-13 12:25:00,106 INFO L140 encePairwiseOnDemand]: 84/90 looper letters, 46 selfloop transitions, 3 changer transitions 31/108 dead transitions. [2024-10-13 12:25:00,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 108 transitions, 565 flow [2024-10-13 12:25:00,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:25:00,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:25:00,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2024-10-13 12:25:00,108 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.34629629629629627 [2024-10-13 12:25:00,108 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 218 flow. Second operand 6 states and 187 transitions. [2024-10-13 12:25:00,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 108 transitions, 565 flow [2024-10-13 12:25:00,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 108 transitions, 553 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-10-13 12:25:00,114 INFO L231 Difference]: Finished difference. Result has 78 places, 60 transitions, 231 flow [2024-10-13 12:25:00,114 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=78, PETRI_TRANSITIONS=60} [2024-10-13 12:25:00,115 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -19 predicate places. [2024-10-13 12:25:00,115 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 60 transitions, 231 flow [2024-10-13 12:25:00,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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-13 12:25:00,116 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:00,116 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, 1, 1, 1, 1, 1] [2024-10-13 12:25:00,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 12:25:00,116 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:25:00,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:00,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1022029818, now seen corresponding path program 4 times [2024-10-13 12:25:00,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:25:00,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907654617] [2024-10-13 12:25:00,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:00,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:25:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:00,829 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-13 12:25:00,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:25:00,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907654617] [2024-10-13 12:25:00,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907654617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:00,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:00,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:25:00,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713987778] [2024-10-13 12:25:00,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:00,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:25:00,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:25:00,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:25:00,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:25:00,840 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 90 [2024-10-13 12:25:00,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 60 transitions, 231 flow. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 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-13 12:25:00,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:00,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 90 [2024-10-13 12:25:00,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:01,938 INFO L124 PetriNetUnfolderBase]: 4518/7892 cut-off events. [2024-10-13 12:25:01,939 INFO L125 PetriNetUnfolderBase]: For 1809/1819 co-relation queries the response was YES. [2024-10-13 12:25:01,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17780 conditions, 7892 events. 4518/7892 cut-off events. For 1809/1819 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 62679 event pairs, 2719 based on Foata normal form. 20/6952 useless extension candidates. Maximal degree in co-relation 17761. Up to 3990 conditions per place. [2024-10-13 12:25:01,980 INFO L140 encePairwiseOnDemand]: 82/90 looper letters, 37 selfloop transitions, 8 changer transitions 17/93 dead transitions. [2024-10-13 12:25:01,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 93 transitions, 453 flow [2024-10-13 12:25:01,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:25:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:25:01,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 239 transitions. [2024-10-13 12:25:01,982 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.33194444444444443 [2024-10-13 12:25:01,982 INFO L175 Difference]: Start difference. First operand has 78 places, 60 transitions, 231 flow. Second operand 8 states and 239 transitions. [2024-10-13 12:25:01,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 93 transitions, 453 flow [2024-10-13 12:25:01,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 93 transitions, 443 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-10-13 12:25:01,990 INFO L231 Difference]: Finished difference. Result has 84 places, 63 transitions, 282 flow [2024-10-13 12:25:01,990 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=282, PETRI_PLACES=84, PETRI_TRANSITIONS=63} [2024-10-13 12:25:01,990 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -13 predicate places. [2024-10-13 12:25:01,991 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 63 transitions, 282 flow [2024-10-13 12:25:01,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 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-13 12:25:01,991 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:01,991 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, 1, 1, 1, 1, 1] [2024-10-13 12:25:01,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 12:25:01,992 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:25:01,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:01,992 INFO L85 PathProgramCache]: Analyzing trace with hash 45582822, now seen corresponding path program 5 times [2024-10-13 12:25:01,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:25:01,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714492028] [2024-10-13 12:25:01,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:01,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:25:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:25:02,149 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:25:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:25:02,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:25:02,388 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:25:02,391 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (79 of 80 remaining) [2024-10-13 12:25:02,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 80 remaining) [2024-10-13 12:25:02,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 80 remaining) [2024-10-13 12:25:02,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 80 remaining) [2024-10-13 12:25:02,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 80 remaining) [2024-10-13 12:25:02,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 80 remaining) [2024-10-13 12:25:02,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 80 remaining) [2024-10-13 12:25:02,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 80 remaining) [2024-10-13 12:25:02,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 80 remaining) [2024-10-13 12:25:02,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 80 remaining) [2024-10-13 12:25:02,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 80 remaining) [2024-10-13 12:25:02,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 80 remaining) [2024-10-13 12:25:02,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 80 remaining) [2024-10-13 12:25:02,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 80 remaining) [2024-10-13 12:25:02,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 80 remaining) [2024-10-13 12:25:02,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 80 remaining) [2024-10-13 12:25:02,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 80 remaining) [2024-10-13 12:25:02,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 80 remaining) [2024-10-13 12:25:02,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 80 remaining) [2024-10-13 12:25:02,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 80 remaining) [2024-10-13 12:25:02,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 80 remaining) [2024-10-13 12:25:02,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 80 remaining) [2024-10-13 12:25:02,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 80 remaining) [2024-10-13 12:25:02,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 80 remaining) [2024-10-13 12:25:02,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 80 remaining) [2024-10-13 12:25:02,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 80 remaining) [2024-10-13 12:25:02,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 80 remaining) [2024-10-13 12:25:02,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 80 remaining) [2024-10-13 12:25:02,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 80 remaining) [2024-10-13 12:25:02,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 80 remaining) [2024-10-13 12:25:02,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 80 remaining) [2024-10-13 12:25:02,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 80 remaining) [2024-10-13 12:25:02,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 80 remaining) [2024-10-13 12:25:02,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 80 remaining) [2024-10-13 12:25:02,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 80 remaining) [2024-10-13 12:25:02,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 80 remaining) [2024-10-13 12:25:02,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 80 remaining) [2024-10-13 12:25:02,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 80 remaining) [2024-10-13 12:25:02,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 80 remaining) [2024-10-13 12:25:02,407 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 80 remaining) [2024-10-13 12:25:02,407 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 80 remaining) [2024-10-13 12:25:02,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (38 of 80 remaining) [2024-10-13 12:25:02,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 80 remaining) [2024-10-13 12:25:02,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 80 remaining) [2024-10-13 12:25:02,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 80 remaining) [2024-10-13 12:25:02,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 80 remaining) [2024-10-13 12:25:02,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 80 remaining) [2024-10-13 12:25:02,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 80 remaining) [2024-10-13 12:25:02,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 80 remaining) [2024-10-13 12:25:02,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 80 remaining) [2024-10-13 12:25:02,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 80 remaining) [2024-10-13 12:25:02,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 80 remaining) [2024-10-13 12:25:02,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 80 remaining) [2024-10-13 12:25:02,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 80 remaining) [2024-10-13 12:25:02,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 80 remaining) [2024-10-13 12:25:02,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 80 remaining) [2024-10-13 12:25:02,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 80 remaining) [2024-10-13 12:25:02,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 80 remaining) [2024-10-13 12:25:02,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 80 remaining) [2024-10-13 12:25:02,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 80 remaining) [2024-10-13 12:25:02,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 80 remaining) [2024-10-13 12:25:02,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 80 remaining) [2024-10-13 12:25:02,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 80 remaining) [2024-10-13 12:25:02,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 80 remaining) [2024-10-13 12:25:02,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 80 remaining) [2024-10-13 12:25:02,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 80 remaining) [2024-10-13 12:25:02,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 80 remaining) [2024-10-13 12:25:02,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 80 remaining) [2024-10-13 12:25:02,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 80 remaining) [2024-10-13 12:25:02,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 80 remaining) [2024-10-13 12:25:02,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 80 remaining) [2024-10-13 12:25:02,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 80 remaining) [2024-10-13 12:25:02,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 80 remaining) [2024-10-13 12:25:02,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 80 remaining) [2024-10-13 12:25:02,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 80 remaining) [2024-10-13 12:25:02,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 80 remaining) [2024-10-13 12:25:02,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 80 remaining) [2024-10-13 12:25:02,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 80 remaining) [2024-10-13 12:25:02,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 80 remaining) [2024-10-13 12:25:02,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 80 remaining) [2024-10-13 12:25:02,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 12:25:02,416 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:25:02,605 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:25:02,605 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:25:02,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:25:02 BasicIcfg [2024-10-13 12:25:02,613 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:25:02,614 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:25:02,614 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:25:02,614 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:25:02,615 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:24:40" (3/4) ... [2024-10-13 12:25:02,617 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:25:02,618 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:25:02,619 INFO L158 Benchmark]: Toolchain (without parser) took 24806.42ms. Allocated memory was 180.4MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 121.3MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 339.1MB. Max. memory is 16.1GB. [2024-10-13 12:25:02,619 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 180.4MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:25:02,620 INFO L158 Benchmark]: CACSL2BoogieTranslator took 696.78ms. Allocated memory is still 180.4MB. Free memory was 121.0MB in the beginning and 93.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-13 12:25:02,620 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.89ms. Allocated memory is still 180.4MB. Free memory was 93.7MB in the beginning and 91.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:25:02,620 INFO L158 Benchmark]: Boogie Preprocessor took 92.92ms. Allocated memory is still 180.4MB. Free memory was 90.9MB in the beginning and 86.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:25:02,620 INFO L158 Benchmark]: RCFGBuilder took 1642.79ms. Allocated memory was 180.4MB in the beginning and 249.6MB in the end (delta: 69.2MB). Free memory was 86.0MB in the beginning and 163.8MB in the end (delta: -77.8MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB. [2024-10-13 12:25:02,621 INFO L158 Benchmark]: TraceAbstraction took 22278.79ms. Allocated memory was 249.6MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 162.7MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 311.6MB. Max. memory is 16.1GB. [2024-10-13 12:25:02,621 INFO L158 Benchmark]: Witness Printer took 4.68ms. Allocated memory is still 2.6GB. Free memory is still 2.2GB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:25:02,623 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 180.4MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 696.78ms. Allocated memory is still 180.4MB. Free memory was 121.0MB in the beginning and 93.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.89ms. Allocated memory is still 180.4MB. Free memory was 93.7MB in the beginning and 91.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.92ms. Allocated memory is still 180.4MB. Free memory was 90.9MB in the beginning and 86.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1642.79ms. Allocated memory was 180.4MB in the beginning and 249.6MB in the end (delta: 69.2MB). Free memory was 86.0MB in the beginning and 163.8MB in the end (delta: -77.8MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB. * TraceAbstraction took 22278.79ms. Allocated memory was 249.6MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 162.7MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 311.6MB. Max. memory is 16.1GB. * Witness Printer took 4.68ms. Allocated memory is still 2.6GB. Free memory is still 2.2GB. 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L743] 0 int y = 0; [L744] 0 _Bool y$flush_delayed; [L745] 0 int y$mem_tmp; [L746] 0 _Bool y$r_buff0_thd0; [L747] 0 _Bool y$r_buff0_thd1; [L748] 0 _Bool y$r_buff0_thd2; [L749] 0 _Bool y$r_buff0_thd3; [L750] 0 _Bool y$r_buff0_thd4; [L751] 0 _Bool y$r_buff1_thd0; [L752] 0 _Bool y$r_buff1_thd1; [L753] 0 _Bool y$r_buff1_thd2; [L754] 0 _Bool y$r_buff1_thd3; [L755] 0 _Bool y$r_buff1_thd4; [L756] 0 _Bool y$read_delayed; [L757] 0 int *y$read_delayed_var; [L758] 0 int y$w_buff0; [L759] 0 _Bool y$w_buff0_used; [L760] 0 int y$w_buff1; [L761] 0 _Bool y$w_buff1_used; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L864] 0 pthread_t t2417; [L865] FCALL, FORK 0 pthread_create(&t2417, ((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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2417=-3, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L768] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 1 y$flush_delayed = weak$$choice2 [L771] EXPR 1 \read(y) [L771] 1 y$mem_tmp = y [L772] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L773] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L773] EXPR 1 \read(y) [L773] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L773] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L774] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L775] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L776] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L777] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L779] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L780] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L781] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L782] EXPR 1 \read(y) [L782] 1 __unbuffered_p0_EAX = y [L783] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L783] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L783] 1 y = y$flush_delayed ? y$mem_tmp : y [L784] 1 y$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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L787] 1 __unbuffered_p0_EBX = x 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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L866] 0 pthread_t t2418; [L867] FCALL, FORK 0 pthread_create(&t2418, ((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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2417=-3, t2418=-2, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L799] 2 x = 1 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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L868] 0 pthread_t t2419; [L869] FCALL, FORK 0 pthread_create(&t2419, ((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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2417=-3, t2418=-2, t2419=-1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L811] 3 __unbuffered_p2_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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L814] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 3 y$flush_delayed = weak$$choice2 [L817] EXPR 3 \read(y) [L817] 3 y$mem_tmp = y [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] EXPR 3 \read(y) [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L819] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L820] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L821] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L822] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L824] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 \read(y) [L825] 3 __unbuffered_p2_EBX = y [L826] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L826] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L826] 3 y = y$flush_delayed ? y$mem_tmp : y [L827] 3 y$flush_delayed = (_Bool)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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L870] 0 pthread_t t2420; [L871] FCALL, FORK 0 pthread_create(&t2420, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2417=-3, t2418=-2, t2419=-1, t2420=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L839] 4 y = 1 VAL [\old(arg)={0:0}, \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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] EXPR 4 \read(y) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L843] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L844] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L845] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L846] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\old(arg)={0:0}, \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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2417=-3, t2418=-2, t2419=-1, t2420=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] EXPR 0 \read(y) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L878] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L879] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L880] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L881] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2417=-3, t2418=-2, t2419=-1, t2420=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L884] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2417=-3, t2418=-2, t2419=-1, t2420=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L888] 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}, \old(arg)={0:0}, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe027_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={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: -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: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 871]: 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: 869]: 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: 867]: 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: 865]: 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 9 procedures, 153 locations, 80 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: 21.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 694 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 658 mSDsluCounter, 85 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1580 IncrementalHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 14 mSDtfsCounter, 1580 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=282occurred in iteration=14, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 336 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 2026 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 12:25:02,667 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/safe027_power.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9d301fd24d7dbc3684a100e80ac453023513d8631f488025251adcc1a8646b5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:25:05,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:25:05,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:25:05,329 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:25:05,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:25:05,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:25:05,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:25:05,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:25:05,355 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:25:05,359 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:25:05,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:25:05,360 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:25:05,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:25:05,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:25:05,361 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:25:05,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:25:05,361 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:25:05,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:25:05,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:25:05,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:25:05,362 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:25:05,364 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:25:05,364 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:25:05,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:25:05,365 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:25:05,366 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:25:05,366 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:25:05,366 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:25:05,366 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:25:05,367 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:25:05,367 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:25:05,367 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:25:05,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:25:05,368 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:25:05,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:25:05,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:25:05,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:25:05,370 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:25:05,370 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:25:05,371 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:25:05,371 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:25:05,371 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:25:05,371 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:25:05,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:25:05,372 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:25:05,372 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 -> a9d301fd24d7dbc3684a100e80ac453023513d8631f488025251adcc1a8646b5 [2024-10-13 12:25:05,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:25:05,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:25:05,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:25:05,726 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:25:05,726 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:25:05,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i [2024-10-13 12:25:07,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:25:07,665 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:25:07,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i [2024-10-13 12:25:07,685 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdad59986/653f6b4aa8e74e6bb57d446fa16939a5/FLAG2762ac3f8 [2024-10-13 12:25:07,698 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdad59986/653f6b4aa8e74e6bb57d446fa16939a5 [2024-10-13 12:25:07,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:25:07,702 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:25:07,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:25:07,703 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:25:07,709 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:25:07,711 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:25:07" (1/1) ... [2024-10-13 12:25:07,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eb737f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:07, skipping insertion in model container [2024-10-13 12:25:07,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:25:07" (1/1) ... [2024-10-13 12:25:07,762 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:25:08,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:25:08,256 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:25:08,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:25:08,396 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:25:08,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:08 WrapperNode [2024-10-13 12:25:08,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:25:08,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:25:08,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:25:08,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:25:08,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:08" (1/1) ... [2024-10-13 12:25:08,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:08" (1/1) ... [2024-10-13 12:25:08,488 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2024-10-13 12:25:08,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:25:08,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:25:08,490 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:25:08,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:25:08,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:08" (1/1) ... [2024-10-13 12:25:08,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:08" (1/1) ... [2024-10-13 12:25:08,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:08" (1/1) ... [2024-10-13 12:25:08,541 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 7 writes are split as follows [0, 7]. [2024-10-13 12:25:08,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:08" (1/1) ... [2024-10-13 12:25:08,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:08" (1/1) ... [2024-10-13 12:25:08,563 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:08" (1/1) ... [2024-10-13 12:25:08,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:08" (1/1) ... [2024-10-13 12:25:08,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:08" (1/1) ... [2024-10-13 12:25:08,581 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:08" (1/1) ... [2024-10-13 12:25:08,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:25:08,589 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:25:08,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:25:08,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:25:08,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:08" (1/1) ... [2024-10-13 12:25:08,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:25:08,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:25:08,631 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-13 12:25:08,637 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-13 12:25:08,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 12:25:08,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 12:25:08,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:25:08,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:25:08,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 12:25:08,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 12:25:08,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 12:25:08,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 12:25:08,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-13 12:25:08,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-13 12:25:08,691 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-13 12:25:08,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-13 12:25:08,691 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-13 12:25:08,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-13 12:25:08,692 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-13 12:25:08,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-13 12:25:08,692 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-13 12:25:08,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-13 12:25:08,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:25:08,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:25:08,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:25:08,696 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:25:08,909 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:25:08,911 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:25:09,699 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:25:09,699 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:25:10,465 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:25:10,466 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 12:25:10,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:25:10 BoogieIcfgContainer [2024-10-13 12:25:10,467 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:25:10,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:25:10,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:25:10,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:25:10,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:25:07" (1/3) ... [2024-10-13 12:25:10,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2012f730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:25:10, skipping insertion in model container [2024-10-13 12:25:10,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:08" (2/3) ... [2024-10-13 12:25:10,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2012f730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:25:10, skipping insertion in model container [2024-10-13 12:25:10,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:25:10" (3/3) ... [2024-10-13 12:25:10,477 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.oepc.i [2024-10-13 12:25:10,497 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:25:10,497 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2024-10-13 12:25:10,498 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:25:10,690 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:25:10,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 90 transitions, 196 flow [2024-10-13 12:25:10,820 INFO L124 PetriNetUnfolderBase]: 2/86 cut-off events. [2024-10-13 12:25:10,821 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:25:10,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 2/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 314 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2024-10-13 12:25:10,829 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 90 transitions, 196 flow [2024-10-13 12:25:10,839 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 86 transitions, 184 flow [2024-10-13 12:25:10,855 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:25:10,863 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;@4369063b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:25:10,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2024-10-13 12:25:10,868 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:25:10,869 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-13 12:25:10,869 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:25:10,869 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:10,870 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-13 12:25:10,870 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:25:10,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:10,877 INFO L85 PathProgramCache]: Analyzing trace with hash 26898297, now seen corresponding path program 1 times [2024-10-13 12:25:10,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:25:10,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868496512] [2024-10-13 12:25:10,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:10,894 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-13 12:25:10,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:25:10,896 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-13 12:25:10,897 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-13 12:25:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:11,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:25:11,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:25:11,179 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-13 12:25:11,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:25:11,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:25:11,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868496512] [2024-10-13 12:25:11,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868496512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:11,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:11,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:25:11,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462475318] [2024-10-13 12:25:11,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:11,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:25:11,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:25:11,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:25:11,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:25:11,250 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 90 [2024-10-13 12:25:11,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 86 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-13 12:25:11,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:11,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 90 [2024-10-13 12:25:11,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:14,221 INFO L124 PetriNetUnfolderBase]: 8251/12424 cut-off events. [2024-10-13 12:25:14,221 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:25:14,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23772 conditions, 12424 events. 8251/12424 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1093. Compared 98978 event pairs, 8251 based on Foata normal form. 448/9055 useless extension candidates. Maximal degree in co-relation 23760. Up to 11252 conditions per place. [2024-10-13 12:25:14,359 INFO L140 encePairwiseOnDemand]: 56/90 looper letters, 32 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2024-10-13 12:25:14,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 52 transitions, 182 flow [2024-10-13 12:25:14,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:25:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:25:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2024-10-13 12:25:14,373 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-10-13 12:25:14,375 INFO L175 Difference]: Start difference. First operand has 97 places, 86 transitions, 184 flow. Second operand 3 states and 135 transitions. [2024-10-13 12:25:14,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 52 transitions, 182 flow [2024-10-13 12:25:14,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 52 transitions, 178 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 12:25:14,386 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 114 flow [2024-10-13 12:25:14,389 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2024-10-13 12:25:14,394 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -34 predicate places. [2024-10-13 12:25:14,394 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 114 flow [2024-10-13 12:25:14,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-13 12:25:14,395 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:14,395 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-13 12:25:14,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 12:25:14,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-13 12:25:14,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:25:14,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:14,600 INFO L85 PathProgramCache]: Analyzing trace with hash 26898298, now seen corresponding path program 1 times [2024-10-13 12:25:14,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:25:14,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220863871] [2024-10-13 12:25:14,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:14,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-13 12:25:14,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:25:14,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-13 12:25:14,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-13 12:25:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:14,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:25:14,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:25:14,798 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-13 12:25:14,799 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:25:14,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:25:14,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220863871] [2024-10-13 12:25:14,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220863871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:14,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:14,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:25:14,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146534658] [2024-10-13 12:25:14,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:14,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:25:14,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:25:14,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:25:14,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:25:14,802 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 90 [2024-10-13 12:25:14,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-13 12:25:14,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:14,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 90 [2024-10-13 12:25:14,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:15,501 INFO L124 PetriNetUnfolderBase]: 2059/3342 cut-off events. [2024-10-13 12:25:15,502 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:25:15,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6308 conditions, 3342 events. 2059/3342 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 24335 event pairs, 2059 based on Foata normal form. 0/3123 useless extension candidates. Maximal degree in co-relation 6302. Up to 2906 conditions per place. [2024-10-13 12:25:15,527 INFO L140 encePairwiseOnDemand]: 82/90 looper letters, 24 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2024-10-13 12:25:15,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 152 flow [2024-10-13 12:25:15,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:25:15,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:25:15,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-10-13 12:25:15,529 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2024-10-13 12:25:15,529 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 114 flow. Second operand 3 states and 102 transitions. [2024-10-13 12:25:15,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 152 flow [2024-10-13 12:25:15,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 45 transitions, 151 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:25:15,531 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 99 flow [2024-10-13 12:25:15,531 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=55, 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=99, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2024-10-13 12:25:15,532 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -40 predicate places. [2024-10-13 12:25:15,532 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 99 flow [2024-10-13 12:25:15,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-13 12:25:15,532 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:15,533 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:25:15,540 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-13 12:25:15,733 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-13 12:25:15,734 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:25:15,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:15,735 INFO L85 PathProgramCache]: Analyzing trace with hash 711615164, now seen corresponding path program 1 times [2024-10-13 12:25:15,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:25:15,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579210522] [2024-10-13 12:25:15,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:15,736 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-13 12:25:15,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:25:15,742 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-13 12:25:15,743 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-13 12:25:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:15,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:25:15,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:25:15,974 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-13 12:25:15,974 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:25:15,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:25:15,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579210522] [2024-10-13 12:25:15,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579210522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:15,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:15,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:25:15,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70792900] [2024-10-13 12:25:15,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:15,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:25:15,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:25:15,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:25:15,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:25:16,000 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 90 [2024-10-13 12:25:16,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-13 12:25:16,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:16,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 90 [2024-10-13 12:25:16,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:18,360 INFO L124 PetriNetUnfolderBase]: 7893/11725 cut-off events. [2024-10-13 12:25:18,360 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:25:18,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22654 conditions, 11725 events. 7893/11725 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 79275 event pairs, 655 based on Foata normal form. 240/11491 useless extension candidates. Maximal degree in co-relation 22647. Up to 8029 conditions per place. [2024-10-13 12:25:18,430 INFO L140 encePairwiseOnDemand]: 83/90 looper letters, 51 selfloop transitions, 6 changer transitions 1/72 dead transitions. [2024-10-13 12:25:18,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 72 transitions, 277 flow [2024-10-13 12:25:18,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:25:18,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:25:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-10-13 12:25:18,432 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-10-13 12:25:18,432 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 99 flow. Second operand 4 states and 132 transitions. [2024-10-13 12:25:18,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 72 transitions, 277 flow [2024-10-13 12:25:18,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:25:18,434 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 140 flow [2024-10-13 12:25:18,435 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2024-10-13 12:25:18,435 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -37 predicate places. [2024-10-13 12:25:18,435 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 140 flow [2024-10-13 12:25:18,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-13 12:25:18,436 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:18,436 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:25:18,441 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-13 12:25:18,636 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-13 12:25:18,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:25:18,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:18,641 INFO L85 PathProgramCache]: Analyzing trace with hash -248228162, now seen corresponding path program 1 times [2024-10-13 12:25:18,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:25:18,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963470806] [2024-10-13 12:25:18,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:18,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:25:18,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:25:18,646 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-13 12:25:18,650 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-13 12:25:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:18,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:25:18,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:25:18,852 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-13 12:25:18,853 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:25:18,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:25:18,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963470806] [2024-10-13 12:25:18,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963470806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:18,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:18,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:25:18,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567209999] [2024-10-13 12:25:18,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:18,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:25:18,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:25:18,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:25:18,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:25:18,865 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 90 [2024-10-13 12:25:18,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:25:18,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:18,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 90 [2024-10-13 12:25:18,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:20,311 INFO L124 PetriNetUnfolderBase]: 6137/9229 cut-off events. [2024-10-13 12:25:20,311 INFO L125 PetriNetUnfolderBase]: For 2205/2210 co-relation queries the response was YES. [2024-10-13 12:25:20,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20733 conditions, 9229 events. 6137/9229 cut-off events. For 2205/2210 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 60170 event pairs, 245 based on Foata normal form. 230/9097 useless extension candidates. Maximal degree in co-relation 20723. Up to 5761 conditions per place. [2024-10-13 12:25:20,377 INFO L140 encePairwiseOnDemand]: 83/90 looper letters, 64 selfloop transitions, 10 changer transitions 1/89 dead transitions. [2024-10-13 12:25:20,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 89 transitions, 401 flow [2024-10-13 12:25:20,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:25:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:25:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2024-10-13 12:25:20,381 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3711111111111111 [2024-10-13 12:25:20,381 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 140 flow. Second operand 5 states and 167 transitions. [2024-10-13 12:25:20,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 89 transitions, 401 flow [2024-10-13 12:25:20,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 89 transitions, 390 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-13 12:25:20,390 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 192 flow [2024-10-13 12:25:20,390 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2024-10-13 12:25:20,391 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -33 predicate places. [2024-10-13 12:25:20,391 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 192 flow [2024-10-13 12:25:20,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:25:20,391 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:20,391 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-13 12:25:20,397 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-13 12:25:20,592 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-13 12:25:20,593 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:25:20,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:20,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1954236856, now seen corresponding path program 1 times [2024-10-13 12:25:20,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:25:20,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737964322] [2024-10-13 12:25:20,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:20,595 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-13 12:25:20,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:25:20,598 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-13 12:25:20,600 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-13 12:25:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:20,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:25:20,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:25:20,836 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-13 12:25:20,836 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:25:20,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:25:20,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737964322] [2024-10-13 12:25:20,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [737964322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:20,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:20,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:25:20,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005745484] [2024-10-13 12:25:20,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:20,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:25:20,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:25:20,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:25:20,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:25:20,856 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 90 [2024-10-13 12:25:20,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 192 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-13 12:25:20,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:20,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 90 [2024-10-13 12:25:20,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:21,828 INFO L124 PetriNetUnfolderBase]: 3549/5389 cut-off events. [2024-10-13 12:25:21,828 INFO L125 PetriNetUnfolderBase]: For 3674/3684 co-relation queries the response was YES. [2024-10-13 12:25:21,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13491 conditions, 5389 events. 3549/5389 cut-off events. For 3674/3684 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 30874 event pairs, 111 based on Foata normal form. 176/5387 useless extension candidates. Maximal degree in co-relation 13479. Up to 2449 conditions per place. [2024-10-13 12:25:21,865 INFO L140 encePairwiseOnDemand]: 83/90 looper letters, 75 selfloop transitions, 14 changer transitions 1/104 dead transitions. [2024-10-13 12:25:21,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 104 transitions, 524 flow [2024-10-13 12:25:21,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:25:21,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:25:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 200 transitions. [2024-10-13 12:25:21,868 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2024-10-13 12:25:21,868 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 192 flow. Second operand 6 states and 200 transitions. [2024-10-13 12:25:21,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 104 transitions, 524 flow [2024-10-13 12:25:21,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 104 transitions, 494 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-13 12:25:21,878 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 242 flow [2024-10-13 12:25:21,878 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2024-10-13 12:25:21,879 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -30 predicate places. [2024-10-13 12:25:21,879 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 242 flow [2024-10-13 12:25:21,879 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-13 12:25:21,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:21,880 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-13 12:25:21,886 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-13 12:25:22,080 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-13 12:25:22,081 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:25:22,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:22,081 INFO L85 PathProgramCache]: Analyzing trace with hash -123586964, now seen corresponding path program 1 times [2024-10-13 12:25:22,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:25:22,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747784713] [2024-10-13 12:25:22,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:22,083 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-13 12:25:22,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:25:22,091 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-13 12:25:22,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 12:25:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:22,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:25:22,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:25:22,377 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-13 12:25:22,377 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:25:22,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:25:22,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747784713] [2024-10-13 12:25:22,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747784713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:22,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:22,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:25:22,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633562332] [2024-10-13 12:25:22,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:22,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:25:22,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:25:22,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:25:22,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:25:22,390 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 90 [2024-10-13 12:25:22,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 242 flow. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 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-13 12:25:22,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:22,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 90 [2024-10-13 12:25:22,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:23,243 INFO L124 PetriNetUnfolderBase]: 1897/2813 cut-off events. [2024-10-13 12:25:23,243 INFO L125 PetriNetUnfolderBase]: For 3576/3586 co-relation queries the response was YES. [2024-10-13 12:25:23,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7996 conditions, 2813 events. 1897/2813 cut-off events. For 3576/3586 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 13503 event pairs, 73 based on Foata normal form. 84/2847 useless extension candidates. Maximal degree in co-relation 7983. Up to 796 conditions per place. [2024-10-13 12:25:23,267 INFO L140 encePairwiseOnDemand]: 83/90 looper letters, 68 selfloop transitions, 18 changer transitions 1/101 dead transitions. [2024-10-13 12:25:23,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 101 transitions, 522 flow [2024-10-13 12:25:23,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:25:23,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:25:23,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 215 transitions. [2024-10-13 12:25:23,269 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3412698412698413 [2024-10-13 12:25:23,269 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 242 flow. Second operand 7 states and 215 transitions. [2024-10-13 12:25:23,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 101 transitions, 522 flow [2024-10-13 12:25:23,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 101 transitions, 476 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-10-13 12:25:23,287 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 252 flow [2024-10-13 12:25:23,287 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=252, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2024-10-13 12:25:23,288 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -27 predicate places. [2024-10-13 12:25:23,288 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 252 flow [2024-10-13 12:25:23,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 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-13 12:25:23,288 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:23,288 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, 1] [2024-10-13 12:25:23,296 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-13 12:25:23,492 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-13 12:25:23,493 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:25:23,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:23,493 INFO L85 PathProgramCache]: Analyzing trace with hash -905926561, now seen corresponding path program 1 times [2024-10-13 12:25:23,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:25:23,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722461403] [2024-10-13 12:25:23,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:23,495 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-13 12:25:23,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:25:23,498 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-13 12:25:23,499 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-13 12:25:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:23,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:25:23,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:25:23,948 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-13 12:25:23,948 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:25:23,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:25:23,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722461403] [2024-10-13 12:25:23,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722461403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:23,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:23,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:25:23,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682621698] [2024-10-13 12:25:23,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:23,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:25:23,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:25:23,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:25:23,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:25:23,957 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 90 [2024-10-13 12:25:23,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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-13 12:25:23,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:23,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 90 [2024-10-13 12:25:23,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:24,366 INFO L124 PetriNetUnfolderBase]: 920/1652 cut-off events. [2024-10-13 12:25:24,367 INFO L125 PetriNetUnfolderBase]: For 891/942 co-relation queries the response was YES. [2024-10-13 12:25:24,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3863 conditions, 1652 events. 920/1652 cut-off events. For 891/942 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8969 event pairs, 504 based on Foata normal form. 0/1526 useless extension candidates. Maximal degree in co-relation 3849. Up to 1051 conditions per place. [2024-10-13 12:25:24,380 INFO L140 encePairwiseOnDemand]: 87/90 looper letters, 35 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2024-10-13 12:25:24,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 356 flow [2024-10-13 12:25:24,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:25:24,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:25:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2024-10-13 12:25:24,382 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2024-10-13 12:25:24,382 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 252 flow. Second operand 4 states and 130 transitions. [2024-10-13 12:25:24,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 356 flow [2024-10-13 12:25:24,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 68 transitions, 260 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-10-13 12:25:24,389 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 158 flow [2024-10-13 12:25:24,389 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2024-10-13 12:25:24,390 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -35 predicate places. [2024-10-13 12:25:24,390 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 158 flow [2024-10-13 12:25:24,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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-13 12:25:24,391 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:24,391 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, 1] [2024-10-13 12:25:24,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 12:25:24,595 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-13 12:25:24,596 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:25:24,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:24,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1415412822, now seen corresponding path program 1 times [2024-10-13 12:25:24,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:25:24,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349743828] [2024-10-13 12:25:24,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:24,598 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-13 12:25:24,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:25:24,601 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-13 12:25:24,603 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-13 12:25:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:24,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:25:24,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:25:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:25:25,106 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:25:25,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:25:25,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349743828] [2024-10-13 12:25:25,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349743828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:25,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:25,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:25:25,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828320041] [2024-10-13 12:25:25,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:25,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:25:25,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:25:25,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:25:25,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:25:25,110 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 90 [2024-10-13 12:25:25,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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-13 12:25:25,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:25,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 90 [2024-10-13 12:25:25,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:25,434 INFO L124 PetriNetUnfolderBase]: 890/1606 cut-off events. [2024-10-13 12:25:25,434 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2024-10-13 12:25:25,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3218 conditions, 1606 events. 890/1606 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8782 event pairs, 470 based on Foata normal form. 0/1494 useless extension candidates. Maximal degree in co-relation 3209. Up to 1003 conditions per place. [2024-10-13 12:25:25,445 INFO L140 encePairwiseOnDemand]: 87/90 looper letters, 34 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2024-10-13 12:25:25,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 67 transitions, 260 flow [2024-10-13 12:25:25,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:25:25,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:25:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2024-10-13 12:25:25,447 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2024-10-13 12:25:25,447 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 158 flow. Second operand 4 states and 129 transitions. [2024-10-13 12:25:25,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 67 transitions, 260 flow [2024-10-13 12:25:25,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 67 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:25:25,449 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 157 flow [2024-10-13 12:25:25,449 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2024-10-13 12:25:25,451 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -35 predicate places. [2024-10-13 12:25:25,451 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 157 flow [2024-10-13 12:25:25,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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-13 12:25:25,452 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:25,452 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, 1, 1, 1, 1, 1] [2024-10-13 12:25:25,458 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-13 12:25:25,652 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-13 12:25:25,653 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:25:25,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:25,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1213553929, now seen corresponding path program 1 times [2024-10-13 12:25:25,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:25:25,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094776658] [2024-10-13 12:25:25,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:25,655 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-13 12:25:25,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:25:25,659 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-13 12:25:25,662 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-13 12:25:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:25,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:25:25,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:25:25,904 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-13 12:25:25,905 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:25:25,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:25:25,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094776658] [2024-10-13 12:25:25,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094776658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:25,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:25,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:25:25,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807164135] [2024-10-13 12:25:25,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:25,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:25:25,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:25:25,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:25:25,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:25:25,910 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 90 [2024-10-13 12:25:25,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 157 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-13 12:25:25,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:25,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 90 [2024-10-13 12:25:25,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:26,199 INFO L124 PetriNetUnfolderBase]: 861/1506 cut-off events. [2024-10-13 12:25:26,199 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2024-10-13 12:25:26,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3150 conditions, 1506 events. 861/1506 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8492 event pairs, 775 based on Foata normal form. 16/1374 useless extension candidates. Maximal degree in co-relation 3141. Up to 1196 conditions per place. [2024-10-13 12:25:26,208 INFO L140 encePairwiseOnDemand]: 88/90 looper letters, 21 selfloop transitions, 1 changer transitions 1/53 dead transitions. [2024-10-13 12:25:26,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 201 flow [2024-10-13 12:25:26,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:25:26,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:25:26,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-10-13 12:25:26,209 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-10-13 12:25:26,209 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 157 flow. Second operand 3 states and 90 transitions. [2024-10-13 12:25:26,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 201 flow [2024-10-13 12:25:26,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 53 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:25:26,211 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 152 flow [2024-10-13 12:25:26,211 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2024-10-13 12:25:26,212 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -36 predicate places. [2024-10-13 12:25:26,212 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 152 flow [2024-10-13 12:25:26,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-13 12:25:26,212 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:26,213 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, 1, 1, 1, 1, 1] [2024-10-13 12:25:26,221 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-13 12:25:26,413 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-13 12:25:26,413 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:25:26,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:26,414 INFO L85 PathProgramCache]: Analyzing trace with hash 275035272, now seen corresponding path program 1 times [2024-10-13 12:25:26,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:25:26,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458520755] [2024-10-13 12:25:26,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:26,415 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-13 12:25:26,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:25:26,417 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-13 12:25:26,418 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-13 12:25:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:26,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:25:26,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:25:26,691 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-13 12:25:26,692 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:25:26,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:25:26,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458520755] [2024-10-13 12:25:26,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458520755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:26,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:26,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:25:26,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609606306] [2024-10-13 12:25:26,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:26,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:25:26,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:25:26,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:25:26,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:25:26,708 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 90 [2024-10-13 12:25:26,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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-13 12:25:26,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:26,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 90 [2024-10-13 12:25:26,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:27,246 INFO L124 PetriNetUnfolderBase]: 2267/3920 cut-off events. [2024-10-13 12:25:27,247 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:25:27,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8186 conditions, 3920 events. 2267/3920 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 25362 event pairs, 422 based on Foata normal form. 16/3747 useless extension candidates. Maximal degree in co-relation 8177. Up to 1325 conditions per place. [2024-10-13 12:25:27,267 INFO L140 encePairwiseOnDemand]: 84/90 looper letters, 41 selfloop transitions, 3 changer transitions 16/88 dead transitions. [2024-10-13 12:25:27,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 88 transitions, 354 flow [2024-10-13 12:25:27,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:25:27,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:25:27,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2024-10-13 12:25:27,269 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.34629629629629627 [2024-10-13 12:25:27,269 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 152 flow. Second operand 6 states and 187 transitions. [2024-10-13 12:25:27,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 88 transitions, 354 flow [2024-10-13 12:25:27,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 88 transitions, 353 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:25:27,272 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 169 flow [2024-10-13 12:25:27,272 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2024-10-13 12:25:27,272 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -30 predicate places. [2024-10-13 12:25:27,273 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 169 flow [2024-10-13 12:25:27,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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-13 12:25:27,273 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:27,273 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, 1, 1, 1, 1, 1] [2024-10-13 12:25:27,281 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-13 12:25:27,474 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-13 12:25:27,474 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:25:27,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:27,475 INFO L85 PathProgramCache]: Analyzing trace with hash -475822798, now seen corresponding path program 2 times [2024-10-13 12:25:27,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:25:27,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087480730] [2024-10-13 12:25:27,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:25:27,476 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-13 12:25:27,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:25:27,479 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-13 12:25:27,480 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-13 12:25:27,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 12:25:27,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:25:27,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 12:25:27,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:25:27,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 12:25:27,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-13 12:25:28,068 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-13 12:25:28,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:25:28,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:25:28,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087480730] [2024-10-13 12:25:28,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087480730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:28,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:28,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 12:25:28,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048485992] [2024-10-13 12:25:28,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:28,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:25:28,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:25:28,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:25:28,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:25:28,094 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 90 [2024-10-13 12:25:28,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 169 flow. Second operand has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 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-13 12:25:28,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:28,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 90 [2024-10-13 12:25:28,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:29,075 INFO L124 PetriNetUnfolderBase]: 3701/6411 cut-off events. [2024-10-13 12:25:29,075 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-10-13 12:25:29,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13039 conditions, 6411 events. 3701/6411 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 48201 event pairs, 1219 based on Foata normal form. 16/5687 useless extension candidates. Maximal degree in co-relation 13026. Up to 1879 conditions per place. [2024-10-13 12:25:29,112 INFO L140 encePairwiseOnDemand]: 82/90 looper letters, 39 selfloop transitions, 6 changer transitions 14/90 dead transitions. [2024-10-13 12:25:29,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 90 transitions, 369 flow [2024-10-13 12:25:29,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:25:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:25:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 244 transitions. [2024-10-13 12:25:29,115 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3388888888888889 [2024-10-13 12:25:29,115 INFO L175 Difference]: Start difference. First operand has 67 places, 53 transitions, 169 flow. Second operand 8 states and 244 transitions. [2024-10-13 12:25:29,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 90 transitions, 369 flow [2024-10-13 12:25:29,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 90 transitions, 359 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-10-13 12:25:29,118 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 206 flow [2024-10-13 12:25:29,118 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=206, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2024-10-13 12:25:29,119 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -24 predicate places. [2024-10-13 12:25:29,119 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 206 flow [2024-10-13 12:25:29,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 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-13 12:25:29,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:29,120 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, 1, 1, 1, 1, 1] [2024-10-13 12:25:29,126 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 (12)] Ended with exit code 0 [2024-10-13 12:25:29,320 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-13 12:25:29,321 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:25:29,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:29,321 INFO L85 PathProgramCache]: Analyzing trace with hash -288118836, now seen corresponding path program 3 times [2024-10-13 12:25:29,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:25:29,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875401997] [2024-10-13 12:25:29,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:25:29,322 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-13 12:25:29,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:25:29,326 INFO L229 MonitoredProcess]: Starting monitored process 13 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-13 12:25:29,327 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 (13)] Waiting until timeout for monitored process [2024-10-13 12:25:29,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-13 12:25:29,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:25:29,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:25:29,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:25:29,570 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-13 12:25:29,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:25:29,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:25:29,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875401997] [2024-10-13 12:25:29,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875401997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:29,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:29,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:25:29,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718899969] [2024-10-13 12:25:29,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:29,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:25:29,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:25:29,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:25:29,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:25:29,586 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 90 [2024-10-13 12:25:29,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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-13 12:25:29,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:29,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 90 [2024-10-13 12:25:29,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:31,055 INFO L124 PetriNetUnfolderBase]: 9017/15473 cut-off events. [2024-10-13 12:25:31,055 INFO L125 PetriNetUnfolderBase]: For 2949/2949 co-relation queries the response was YES. [2024-10-13 12:25:31,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33089 conditions, 15473 events. 9017/15473 cut-off events. For 2949/2949 co-relation queries the response was YES. Maximal size of possible extension queue 1108. Compared 129821 event pairs, 2596 based on Foata normal form. 16/14246 useless extension candidates. Maximal degree in co-relation 33073. Up to 5690 conditions per place. [2024-10-13 12:25:31,139 INFO L140 encePairwiseOnDemand]: 85/90 looper letters, 35 selfloop transitions, 1 changer transitions 34/99 dead transitions. [2024-10-13 12:25:31,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 99 transitions, 484 flow [2024-10-13 12:25:31,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:25:31,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:25:31,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 188 transitions. [2024-10-13 12:25:31,141 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.34814814814814815 [2024-10-13 12:25:31,141 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 206 flow. Second operand 6 states and 188 transitions. [2024-10-13 12:25:31,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 99 transitions, 484 flow [2024-10-13 12:25:31,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 99 transitions, 477 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-10-13 12:25:31,153 INFO L231 Difference]: Finished difference. Result has 77 places, 55 transitions, 198 flow [2024-10-13 12:25:31,153 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=77, PETRI_TRANSITIONS=55} [2024-10-13 12:25:31,154 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -20 predicate places. [2024-10-13 12:25:31,154 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 55 transitions, 198 flow [2024-10-13 12:25:31,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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-13 12:25:31,154 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:31,154 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, 1, 1, 1, 1, 1] [2024-10-13 12:25:31,162 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 (13)] Forceful destruction successful, exit code 0 [2024-10-13 12:25:31,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-13 12:25:31,355 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-10-13 12:25:31,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:31,356 INFO L85 PathProgramCache]: Analyzing trace with hash 718407670, now seen corresponding path program 4 times [2024-10-13 12:25:31,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:25:31,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983004720] [2024-10-13 12:25:31,356 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 12:25:31,357 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-13 12:25:31,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:25:31,358 INFO L229 MonitoredProcess]: Starting monitored process 14 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-13 12:25:31,359 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 (14)] Waiting until timeout for monitored process [2024-10-13 12:25:31,581 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 12:25:31,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 12:25:31,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:25:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:25:31,832 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-13 12:25:31,832 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:25:31,833 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (79 of 80 remaining) [2024-10-13 12:25:31,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 80 remaining) [2024-10-13 12:25:31,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 80 remaining) [2024-10-13 12:25:31,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 80 remaining) [2024-10-13 12:25:31,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 80 remaining) [2024-10-13 12:25:31,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 80 remaining) [2024-10-13 12:25:31,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 80 remaining) [2024-10-13 12:25:31,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 80 remaining) [2024-10-13 12:25:31,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 80 remaining) [2024-10-13 12:25:31,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 80 remaining) [2024-10-13 12:25:31,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 80 remaining) [2024-10-13 12:25:31,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 80 remaining) [2024-10-13 12:25:31,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 80 remaining) [2024-10-13 12:25:31,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 80 remaining) [2024-10-13 12:25:31,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 80 remaining) [2024-10-13 12:25:31,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 80 remaining) [2024-10-13 12:25:31,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 80 remaining) [2024-10-13 12:25:31,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 80 remaining) [2024-10-13 12:25:31,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 80 remaining) [2024-10-13 12:25:31,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 80 remaining) [2024-10-13 12:25:31,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 80 remaining) [2024-10-13 12:25:31,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 80 remaining) [2024-10-13 12:25:31,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 80 remaining) [2024-10-13 12:25:31,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 80 remaining) [2024-10-13 12:25:31,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 80 remaining) [2024-10-13 12:25:31,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 80 remaining) [2024-10-13 12:25:31,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 80 remaining) [2024-10-13 12:25:31,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 80 remaining) [2024-10-13 12:25:31,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 80 remaining) [2024-10-13 12:25:31,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 80 remaining) [2024-10-13 12:25:31,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 80 remaining) [2024-10-13 12:25:31,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 80 remaining) [2024-10-13 12:25:31,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 80 remaining) [2024-10-13 12:25:31,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 80 remaining) [2024-10-13 12:25:31,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 80 remaining) [2024-10-13 12:25:31,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 80 remaining) [2024-10-13 12:25:31,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 80 remaining) [2024-10-13 12:25:31,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 80 remaining) [2024-10-13 12:25:31,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 80 remaining) [2024-10-13 12:25:31,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 80 remaining) [2024-10-13 12:25:31,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 80 remaining) [2024-10-13 12:25:31,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (38 of 80 remaining) [2024-10-13 12:25:31,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 80 remaining) [2024-10-13 12:25:31,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 80 remaining) [2024-10-13 12:25:31,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 80 remaining) [2024-10-13 12:25:31,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 80 remaining) [2024-10-13 12:25:31,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 80 remaining) [2024-10-13 12:25:31,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 80 remaining) [2024-10-13 12:25:31,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 80 remaining) [2024-10-13 12:25:31,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 80 remaining) [2024-10-13 12:25:31,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 80 remaining) [2024-10-13 12:25:31,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 80 remaining) [2024-10-13 12:25:31,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 80 remaining) [2024-10-13 12:25:31,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 80 remaining) [2024-10-13 12:25:31,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 80 remaining) [2024-10-13 12:25:31,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 80 remaining) [2024-10-13 12:25:31,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 80 remaining) [2024-10-13 12:25:31,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 80 remaining) [2024-10-13 12:25:31,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 80 remaining) [2024-10-13 12:25:31,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 80 remaining) [2024-10-13 12:25:31,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 80 remaining) [2024-10-13 12:25:31,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 80 remaining) [2024-10-13 12:25:31,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 80 remaining) [2024-10-13 12:25:31,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 80 remaining) [2024-10-13 12:25:31,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 80 remaining) [2024-10-13 12:25:31,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 80 remaining) [2024-10-13 12:25:31,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 80 remaining) [2024-10-13 12:25:31,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 80 remaining) [2024-10-13 12:25:31,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 80 remaining) [2024-10-13 12:25:31,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 80 remaining) [2024-10-13 12:25:31,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 80 remaining) [2024-10-13 12:25:31,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 80 remaining) [2024-10-13 12:25:31,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 80 remaining) [2024-10-13 12:25:31,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 80 remaining) [2024-10-13 12:25:31,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 80 remaining) [2024-10-13 12:25:31,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 80 remaining) [2024-10-13 12:25:31,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 80 remaining) [2024-10-13 12:25:31,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 80 remaining) [2024-10-13 12:25:31,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 80 remaining) [2024-10-13 12:25:31,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 80 remaining) [2024-10-13 12:25:31,858 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 (14)] Ended with exit code 0 [2024-10-13 12:25:32,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-13 12:25:32,050 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:25:32,223 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:25:32,223 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:25:32,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:25:32 BasicIcfg [2024-10-13 12:25:32,231 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:25:32,232 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:25:32,232 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:25:32,232 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:25:32,233 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:25:10" (3/4) ... [2024-10-13 12:25:32,237 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:25:32,239 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:25:32,240 INFO L158 Benchmark]: Toolchain (without parser) took 24537.78ms. Allocated memory was 73.4MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 39.6MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 816.5MB. Max. memory is 16.1GB. [2024-10-13 12:25:32,240 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 52.4MB. Free memory is still 34.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:25:32,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 706.00ms. Allocated memory is still 73.4MB. Free memory was 39.4MB in the beginning and 50.1MB in the end (delta: -10.7MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-10-13 12:25:32,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.28ms. Allocated memory is still 73.4MB. Free memory was 50.1MB in the beginning and 47.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:25:32,241 INFO L158 Benchmark]: Boogie Preprocessor took 98.39ms. Allocated memory is still 73.4MB. Free memory was 47.7MB in the beginning and 42.8MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:25:32,241 INFO L158 Benchmark]: RCFGBuilder took 1877.29ms. Allocated memory was 73.4MB in the beginning and 115.3MB in the end (delta: 41.9MB). Free memory was 42.8MB in the beginning and 47.5MB in the end (delta: -4.7MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2024-10-13 12:25:32,242 INFO L158 Benchmark]: TraceAbstraction took 21761.22ms. Allocated memory was 115.3MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 47.5MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 779.9MB. Max. memory is 16.1GB. [2024-10-13 12:25:32,242 INFO L158 Benchmark]: Witness Printer took 7.11ms. Allocated memory is still 2.8GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:25:32,244 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 52.4MB. Free memory is still 34.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 706.00ms. Allocated memory is still 73.4MB. Free memory was 39.4MB in the beginning and 50.1MB in the end (delta: -10.7MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.28ms. Allocated memory is still 73.4MB. Free memory was 50.1MB in the beginning and 47.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.39ms. Allocated memory is still 73.4MB. Free memory was 47.7MB in the beginning and 42.8MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1877.29ms. Allocated memory was 73.4MB in the beginning and 115.3MB in the end (delta: 41.9MB). Free memory was 42.8MB in the beginning and 47.5MB in the end (delta: -4.7MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21761.22ms. Allocated memory was 115.3MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 47.5MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 779.9MB. Max. memory is 16.1GB. * Witness Printer took 7.11ms. Allocated memory is still 2.8GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L743] 0 int y = 0; [L744] 0 _Bool y$flush_delayed; [L745] 0 int y$mem_tmp; [L746] 0 _Bool y$r_buff0_thd0; [L747] 0 _Bool y$r_buff0_thd1; [L748] 0 _Bool y$r_buff0_thd2; [L749] 0 _Bool y$r_buff0_thd3; [L750] 0 _Bool y$r_buff0_thd4; [L751] 0 _Bool y$r_buff1_thd0; [L752] 0 _Bool y$r_buff1_thd1; [L753] 0 _Bool y$r_buff1_thd2; [L754] 0 _Bool y$r_buff1_thd3; [L755] 0 _Bool y$r_buff1_thd4; [L756] 0 _Bool y$read_delayed; [L757] 0 int *y$read_delayed_var; [L758] 0 int y$w_buff0; [L759] 0 _Bool y$w_buff0_used; [L760] 0 int y$w_buff1; [L761] 0 _Bool y$w_buff1_used; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L864] 0 pthread_t t2417; [L865] FCALL, FORK 0 pthread_create(&t2417, ((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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2417=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L768] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 1 y$flush_delayed = weak$$choice2 [L771] EXPR 1 \read(y) [L771] 1 y$mem_tmp = y [L772] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L773] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L773] EXPR 1 \read(y) [L773] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L773] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L774] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L775] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L776] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L777] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L779] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L780] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L781] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L782] EXPR 1 \read(y) [L782] 1 __unbuffered_p0_EAX = y [L783] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L783] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L783] 1 y = y$flush_delayed ? y$mem_tmp : y [L784] 1 y$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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L866] 0 pthread_t t2418; [L867] FCALL, FORK 0 pthread_create(&t2418, ((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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2417=0, t2418=1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L787] 1 __unbuffered_p0_EBX = x 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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L868] 0 pthread_t t2419; [L869] FCALL, FORK 0 pthread_create(&t2419, ((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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2417=0, t2418=1, t2419=2, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L870] 0 pthread_t t2420; [L871] FCALL, FORK 0 pthread_create(&t2420, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2417=0, t2418=1, t2419=2, t2420=3, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L799] 2 x = 1 VAL [\old(arg)={0:0}, \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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L811] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L814] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 3 y$flush_delayed = weak$$choice2 [L817] EXPR 3 \read(y) [L817] 3 y$mem_tmp = y [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] EXPR 3 \read(y) [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L819] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L820] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L821] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L822] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L824] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 \read(y) [L825] 3 __unbuffered_p2_EBX = y [L826] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L826] EXPR 3 \read(y) [L826] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L826] 3 y = y$flush_delayed ? y$mem_tmp : y [L827] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, 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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L839] 4 y = 1 VAL [\old(arg)={0:0}, \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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, 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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] EXPR 4 \read(y) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L843] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L844] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L845] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L846] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\old(arg)={0:0}, \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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, 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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, 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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, 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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, 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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, 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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2417=0, t2418=1, t2419=2, t2420=3, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] EXPR 0 \read(y) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L878] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L879] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L880] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L881] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2417=0, t2418=1, t2419=2, t2420=3, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L884] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2417=0, t2418=1, t2419=2, t2420=3, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L888] 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}, \old(arg)={0:0}, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, 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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe027_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, 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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={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: -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: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 871]: 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: 869]: 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: 867]: 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: 865]: 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 9 procedures, 153 locations, 80 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: 21.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 621 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 594 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1613 IncrementalHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 5 mSDtfsCounter, 1613 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=6, InterpolantAutomatonStates: 59, 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.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 322 NumberOfCodeBlocks, 322 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 275 ConstructedInterpolants, 0 QuantifiedInterpolants, 1612 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1972 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-13 12:25:32,280 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