./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe019_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 e9fa0a1b11704376245a2fedbc5c4fb7e02255cba008bc8067c3e06529a17976 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:31:49,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:31:49,064 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 21:31:49,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:31:49,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:31:49,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:31:49,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:31:49,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:31:49,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:31:49,099 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:31:49,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:31:49,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:31:49,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:31:49,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:31:49,101 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:31:49,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:31:49,101 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:31:49,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:31:49,102 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:31:49,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:31:49,102 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:31:49,103 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:31:49,103 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:31:49,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:31:49,103 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:31:49,103 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:31:49,104 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:31:49,104 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:31:49,104 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:31:49,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:31:49,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:31:49,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:31:49,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:31:49,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:31:49,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:31:49,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:31:49,107 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 21:31:49,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 21:31:49,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:31:49,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:31:49,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:31:49,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:31:49,108 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 -> e9fa0a1b11704376245a2fedbc5c4fb7e02255cba008bc8067c3e06529a17976 [2024-11-22 21:31:49,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:31:49,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:31:49,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:31:49,340 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:31:49,340 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:31:49,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i [2024-11-22 21:31:50,580 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:31:50,800 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:31:50,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i [2024-11-22 21:31:50,820 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cb6562c2/75d7d35231f042d0b57ba19780faf3e3/FLAGf42ae0d92 [2024-11-22 21:31:50,834 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cb6562c2/75d7d35231f042d0b57ba19780faf3e3 [2024-11-22 21:31:50,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:31:50,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:31:50,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:31:50,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:31:50,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:31:50,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:31:50" (1/1) ... [2024-11-22 21:31:50,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b99e584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:50, skipping insertion in model container [2024-11-22 21:31:50,848 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:31:50" (1/1) ... [2024-11-22 21:31:50,891 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:31:51,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:31:51,267 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:31:51,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:31:51,346 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:31:51,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:51 WrapperNode [2024-11-22 21:31:51,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:31:51,347 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:31:51,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:31:51,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:31:51,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:51" (1/1) ... [2024-11-22 21:31:51,365 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:51" (1/1) ... [2024-11-22 21:31:51,387 INFO L138 Inliner]: procedures = 176, calls = 72, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 173 [2024-11-22 21:31:51,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:31:51,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:31:51,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:31:51,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:31:51,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:51" (1/1) ... [2024-11-22 21:31:51,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:51" (1/1) ... [2024-11-22 21:31:51,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:51" (1/1) ... [2024-11-22 21:31:51,424 INFO L175 MemorySlicer]: Split 26 memory accesses to 2 slices as follows [2, 24]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 9 writes are split as follows [0, 9]. [2024-11-22 21:31:51,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:51" (1/1) ... [2024-11-22 21:31:51,425 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:51" (1/1) ... [2024-11-22 21:31:51,435 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:51" (1/1) ... [2024-11-22 21:31:51,436 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:51" (1/1) ... [2024-11-22 21:31:51,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:51" (1/1) ... [2024-11-22 21:31:51,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:51" (1/1) ... [2024-11-22 21:31:51,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:31:51,443 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:31:51,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:31:51,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:31:51,444 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:51" (1/1) ... [2024-11-22 21:31:51,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:31:51,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:31:51,478 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 21:31:51,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 21:31:51,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 21:31:51,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 21:31:51,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 21:31:51,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 21:31:51,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 21:31:51,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:31:51,523 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-22 21:31:51,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-22 21:31:51,523 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-22 21:31:51,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-22 21:31:51,523 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-22 21:31:51,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-22 21:31:51,524 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-22 21:31:51,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-22 21:31:51,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 21:31:51,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 21:31:51,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 21:31:51,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:31:51,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:31:51,526 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:31:51,645 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:31:51,647 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:31:52,135 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:31:52,141 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:31:52,682 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:31:52,683 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 21:31:52,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:31:52 BoogieIcfgContainer [2024-11-22 21:31:52,684 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:31:52,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:31:52,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:31:52,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:31:52,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:31:50" (1/3) ... [2024-11-22 21:31:52,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a4a254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:31:52, skipping insertion in model container [2024-11-22 21:31:52,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:51" (2/3) ... [2024-11-22 21:31:52,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a4a254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:31:52, skipping insertion in model container [2024-11-22 21:31:52,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:31:52" (3/3) ... [2024-11-22 21:31:52,691 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.oepc.i [2024-11-22 21:31:52,705 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:31:52,705 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2024-11-22 21:31:52,705 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:31:52,868 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:31:52,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 96 transitions, 208 flow [2024-11-22 21:31:52,941 INFO L124 PetriNetUnfolderBase]: 2/92 cut-off events. [2024-11-22 21:31:52,941 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:31:52,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 379 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2024-11-22 21:31:52,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 96 transitions, 208 flow [2024-11-22 21:31:52,954 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 92 transitions, 196 flow [2024-11-22 21:31:52,965 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:31:52,971 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;@309c60e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:31:52,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2024-11-22 21:31:52,975 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:31:52,976 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-22 21:31:52,976 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:31:52,976 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:52,977 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-22 21:31:52,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:31:52,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:52,982 INFO L85 PathProgramCache]: Analyzing trace with hash 29772261, now seen corresponding path program 1 times [2024-11-22 21:31:52,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:52,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689936740] [2024-11-22 21:31:52,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:52,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:53,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:31:53,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:53,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689936740] [2024-11-22 21:31:53,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689936740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:53,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:53,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:31:53,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958328174] [2024-11-22 21:31:53,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:53,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:31:53,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:53,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:31:53,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:31:53,317 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 96 [2024-11-22 21:31:53,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 92 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:53,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:53,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 96 [2024-11-22 21:31:53,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:56,975 INFO L124 PetriNetUnfolderBase]: 16139/23720 cut-off events. [2024-11-22 21:31:56,976 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-22 21:31:57,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45628 conditions, 23720 events. 16139/23720 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 2051. Compared 190243 event pairs, 16139 based on Foata normal form. 784/16278 useless extension candidates. Maximal degree in co-relation 45616. Up to 21764 conditions per place. [2024-11-22 21:31:57,161 INFO L140 encePairwiseOnDemand]: 59/96 looper letters, 36 selfloop transitions, 1 changer transitions 0/55 dead transitions. [2024-11-22 21:31:57,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 55 transitions, 196 flow [2024-11-22 21:31:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:31:57,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:31:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2024-11-22 21:31:57,171 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4826388888888889 [2024-11-22 21:31:57,173 INFO L175 Difference]: Start difference. First operand has 103 places, 92 transitions, 196 flow. Second operand 3 states and 139 transitions. [2024-11-22 21:31:57,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 55 transitions, 196 flow [2024-11-22 21:31:57,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 55 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-22 21:31:57,184 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 120 flow [2024-11-22 21:31:57,186 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2024-11-22 21:31:57,188 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -37 predicate places. [2024-11-22 21:31:57,190 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 120 flow [2024-11-22 21:31:57,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:57,191 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:57,191 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-22 21:31:57,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 21:31:57,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:31:57,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:57,193 INFO L85 PathProgramCache]: Analyzing trace with hash 29772262, now seen corresponding path program 1 times [2024-11-22 21:31:57,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:57,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122575994] [2024-11-22 21:31:57,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:57,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:31:57,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:57,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122575994] [2024-11-22 21:31:57,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122575994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:57,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:57,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:31:57,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652949386] [2024-11-22 21:31:57,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:57,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:31:57,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:57,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:31:57,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:31:57,294 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 96 [2024-11-22 21:31:57,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:57,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:57,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 96 [2024-11-22 21:31:57,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:58,317 INFO L124 PetriNetUnfolderBase]: 2831/4522 cut-off events. [2024-11-22 21:31:58,318 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:31:58,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8548 conditions, 4522 events. 2831/4522 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 32694 event pairs, 2831 based on Foata normal form. 0/4284 useless extension candidates. Maximal degree in co-relation 8542. Up to 3954 conditions per place. [2024-11-22 21:31:58,334 INFO L140 encePairwiseOnDemand]: 85/96 looper letters, 25 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2024-11-22 21:31:58,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 154 flow [2024-11-22 21:31:58,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:31:58,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:31:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-11-22 21:31:58,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3576388888888889 [2024-11-22 21:31:58,337 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 120 flow. Second operand 3 states and 103 transitions. [2024-11-22 21:31:58,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 154 flow [2024-11-22 21:31:58,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 45 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:31:58,338 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 99 flow [2024-11-22 21:31:58,338 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, 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-11-22 21:31:58,338 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -46 predicate places. [2024-11-22 21:31:58,339 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 99 flow [2024-11-22 21:31:58,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:58,339 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:58,339 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:31:58,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 21:31:58,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:31:58,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:58,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1349882490, now seen corresponding path program 1 times [2024-11-22 21:31:58,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:58,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565196849] [2024-11-22 21:31:58,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:58,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:58,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:31:58,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:58,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565196849] [2024-11-22 21:31:58,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565196849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:58,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:58,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:31:58,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815887952] [2024-11-22 21:31:58,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:58,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:31:58,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:58,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:31:58,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:31:58,507 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 96 [2024-11-22 21:31:58,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:58,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:58,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 96 [2024-11-22 21:31:58,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:59,032 INFO L124 PetriNetUnfolderBase]: 2383/3785 cut-off events. [2024-11-22 21:31:59,032 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:31:59,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7204 conditions, 3785 events. 2383/3785 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 24752 event pairs, 1171 based on Foata normal form. 0/3632 useless extension candidates. Maximal degree in co-relation 7197. Up to 2565 conditions per place. [2024-11-22 21:31:59,053 INFO L140 encePairwiseOnDemand]: 92/96 looper letters, 44 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-11-22 21:31:59,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 64 transitions, 237 flow [2024-11-22 21:31:59,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:31:59,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:31:59,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-11-22 21:31:59,055 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-11-22 21:31:59,055 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 99 flow. Second operand 3 states and 114 transitions. [2024-11-22 21:31:59,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 64 transitions, 237 flow [2024-11-22 21:31:59,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:31:59,056 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 108 flow [2024-11-22 21:31:59,057 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, 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-11-22 21:31:59,057 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -45 predicate places. [2024-11-22 21:31:59,057 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 108 flow [2024-11-22 21:31:59,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:59,057 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:59,057 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:31:59,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 21:31:59,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:31:59,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:59,058 INFO L85 PathProgramCache]: Analyzing trace with hash -156856299, now seen corresponding path program 1 times [2024-11-22 21:31:59,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:59,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86266388] [2024-11-22 21:31:59,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:59,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:31:59,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:59,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86266388] [2024-11-22 21:31:59,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86266388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:59,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:59,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:31:59,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304567710] [2024-11-22 21:31:59,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:59,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:31:59,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:59,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:31:59,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:31:59,205 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 96 [2024-11-22 21:31:59,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:59,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:59,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 96 [2024-11-22 21:31:59,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:59,888 INFO L124 PetriNetUnfolderBase]: 2223/4145 cut-off events. [2024-11-22 21:31:59,888 INFO L125 PetriNetUnfolderBase]: For 310/310 co-relation queries the response was YES. [2024-11-22 21:31:59,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7962 conditions, 4145 events. 2223/4145 cut-off events. For 310/310 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 32884 event pairs, 535 based on Foata normal form. 0/4096 useless extension candidates. Maximal degree in co-relation 7953. Up to 2340 conditions per place. [2024-11-22 21:31:59,909 INFO L140 encePairwiseOnDemand]: 93/96 looper letters, 43 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-11-22 21:31:59,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 240 flow [2024-11-22 21:31:59,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:31:59,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:31:59,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-11-22 21:31:59,910 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3489583333333333 [2024-11-22 21:31:59,911 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 108 flow. Second operand 4 states and 134 transitions. [2024-11-22 21:31:59,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 240 flow [2024-11-22 21:31:59,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 63 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:31:59,912 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 104 flow [2024-11-22 21:31:59,912 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, 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-11-22 21:31:59,912 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -45 predicate places. [2024-11-22 21:31:59,913 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 104 flow [2024-11-22 21:31:59,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:59,913 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:59,913 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:31:59,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 21:31:59,913 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:31:59,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:59,914 INFO L85 PathProgramCache]: Analyzing trace with hash -156856298, now seen corresponding path program 1 times [2024-11-22 21:31:59,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:59,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942037939] [2024-11-22 21:31:59,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:59,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:32:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:00,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:32:00,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942037939] [2024-11-22 21:32:00,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942037939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:00,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:00,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:32:00,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945831467] [2024-11-22 21:32:00,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:00,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:32:00,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:32:00,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:32:00,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:32:00,208 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 96 [2024-11-22 21:32:00,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:00,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:00,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 96 [2024-11-22 21:32:00,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:00,837 INFO L124 PetriNetUnfolderBase]: 2063/3337 cut-off events. [2024-11-22 21:32:00,837 INFO L125 PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES. [2024-11-22 21:32:00,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6866 conditions, 3337 events. 2063/3337 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 21514 event pairs, 947 based on Foata normal form. 64/3384 useless extension candidates. Maximal degree in co-relation 6857. Up to 2116 conditions per place. [2024-11-22 21:32:00,856 INFO L140 encePairwiseOnDemand]: 93/96 looper letters, 42 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2024-11-22 21:32:00,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 234 flow [2024-11-22 21:32:00,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:32:00,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:32:00,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2024-11-22 21:32:00,858 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3463541666666667 [2024-11-22 21:32:00,858 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 104 flow. Second operand 4 states and 133 transitions. [2024-11-22 21:32:00,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 234 flow [2024-11-22 21:32:00,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 62 transitions, 229 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:32:00,860 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 99 flow [2024-11-22 21:32:00,860 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, 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-11-22 21:32:00,860 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -46 predicate places. [2024-11-22 21:32:00,860 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 99 flow [2024-11-22 21:32:00,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:00,861 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:00,861 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:32:00,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 21:32:00,861 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:32:00,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:00,862 INFO L85 PathProgramCache]: Analyzing trace with hash -468028489, now seen corresponding path program 1 times [2024-11-22 21:32:00,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:32:00,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395855561] [2024-11-22 21:32:00,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:32:00,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:32:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:32:00,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:00,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:32:00,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395855561] [2024-11-22 21:32:00,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395855561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:00,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:00,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:32:00,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33601930] [2024-11-22 21:32:00,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:00,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:32:00,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:32:00,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:32:00,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:32:00,915 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 96 [2024-11-22 21:32:00,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:00,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:00,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 96 [2024-11-22 21:32:00,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:01,435 INFO L124 PetriNetUnfolderBase]: 2063/3370 cut-off events. [2024-11-22 21:32:01,435 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2024-11-22 21:32:01,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6898 conditions, 3370 events. 2063/3370 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 23663 event pairs, 2063 based on Foata normal form. 96/3420 useless extension candidates. Maximal degree in co-relation 6890. Up to 2898 conditions per place. [2024-11-22 21:32:01,451 INFO L140 encePairwiseOnDemand]: 94/96 looper letters, 22 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-11-22 21:32:01,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 41 transitions, 145 flow [2024-11-22 21:32:01,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:32:01,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:32:01,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-11-22 21:32:01,453 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3055555555555556 [2024-11-22 21:32:01,453 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 99 flow. Second operand 3 states and 88 transitions. [2024-11-22 21:32:01,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 41 transitions, 145 flow [2024-11-22 21:32:01,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 41 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:32:01,454 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 94 flow [2024-11-22 21:32:01,454 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, 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-11-22 21:32:01,454 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -47 predicate places. [2024-11-22 21:32:01,455 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 94 flow [2024-11-22 21:32:01,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:01,455 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:01,455 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:32:01,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 21:32:01,455 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:32:01,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:01,455 INFO L85 PathProgramCache]: Analyzing trace with hash -468030220, now seen corresponding path program 1 times [2024-11-22 21:32:01,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:32:01,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951099141] [2024-11-22 21:32:01,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:32:01,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:32:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:32:01,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:01,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:32:01,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951099141] [2024-11-22 21:32:01,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951099141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:01,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:01,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:32:01,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80520509] [2024-11-22 21:32:01,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:01,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:32:01,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:32:01,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:32:01,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:32:01,634 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 96 [2024-11-22 21:32:01,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:01,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:01,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 96 [2024-11-22 21:32:01,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:03,110 INFO L124 PetriNetUnfolderBase]: 7438/11046 cut-off events. [2024-11-22 21:32:03,111 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:32:03,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22707 conditions, 11046 events. 7438/11046 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 72368 event pairs, 770 based on Foata normal form. 300/11333 useless extension candidates. Maximal degree in co-relation 22699. Up to 6691 conditions per place. [2024-11-22 21:32:03,171 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 51 selfloop transitions, 6 changer transitions 1/70 dead transitions. [2024-11-22 21:32:03,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 70 transitions, 280 flow [2024-11-22 21:32:03,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:32:03,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:32:03,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2024-11-22 21:32:03,173 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-11-22 21:32:03,173 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 94 flow. Second operand 4 states and 128 transitions. [2024-11-22 21:32:03,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 70 transitions, 280 flow [2024-11-22 21:32:03,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:32:03,175 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 135 flow [2024-11-22 21:32:03,175 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, 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-11-22 21:32:03,175 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -44 predicate places. [2024-11-22 21:32:03,176 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 135 flow [2024-11-22 21:32:03,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:03,176 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:03,176 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:32:03,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 21:32:03,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:32:03,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:03,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1206660726, now seen corresponding path program 1 times [2024-11-22 21:32:03,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:32:03,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338051493] [2024-11-22 21:32:03,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:32:03,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:32:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:32:03,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:03,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:32:03,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338051493] [2024-11-22 21:32:03,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338051493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:03,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:03,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:32:03,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69293596] [2024-11-22 21:32:03,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:03,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:32:03,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:32:03,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:32:03,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:32:03,382 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 96 [2024-11-22 21:32:03,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:03,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:03,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 96 [2024-11-22 21:32:03,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:04,885 INFO L124 PetriNetUnfolderBase]: 5806/8694 cut-off events. [2024-11-22 21:32:04,886 INFO L125 PetriNetUnfolderBase]: For 2109/2109 co-relation queries the response was YES. [2024-11-22 21:32:04,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20738 conditions, 8694 events. 5806/8694 cut-off events. For 2109/2109 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 54491 event pairs, 294 based on Foata normal form. 282/8963 useless extension candidates. Maximal degree in co-relation 20727. Up to 4585 conditions per place. [2024-11-22 21:32:04,918 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 65 selfloop transitions, 10 changer transitions 1/88 dead transitions. [2024-11-22 21:32:04,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 88 transitions, 410 flow [2024-11-22 21:32:04,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:32:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:32:04,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2024-11-22 21:32:04,919 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.33958333333333335 [2024-11-22 21:32:04,919 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 135 flow. Second operand 5 states and 163 transitions. [2024-11-22 21:32:04,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 88 transitions, 410 flow [2024-11-22 21:32:04,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 88 transitions, 399 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-22 21:32:04,923 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 187 flow [2024-11-22 21:32:04,923 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, 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-11-22 21:32:04,923 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -40 predicate places. [2024-11-22 21:32:04,924 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 187 flow [2024-11-22 21:32:04,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:04,924 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:04,924 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:32:04,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 21:32:04,927 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:32:04,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:04,927 INFO L85 PathProgramCache]: Analyzing trace with hash 171924288, now seen corresponding path program 1 times [2024-11-22 21:32:04,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:32:04,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286441237] [2024-11-22 21:32:04,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:32:04,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:32:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:32:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:05,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:32:05,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286441237] [2024-11-22 21:32:05,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286441237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:05,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:05,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:32:05,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205724853] [2024-11-22 21:32:05,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:05,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:32:05,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:32:05,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:32:05,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:32:05,143 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 96 [2024-11-22 21:32:05,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:05,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:05,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 96 [2024-11-22 21:32:05,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:05,782 INFO L124 PetriNetUnfolderBase]: 3561/5327 cut-off events. [2024-11-22 21:32:05,782 INFO L125 PetriNetUnfolderBase]: For 3900/3900 co-relation queries the response was YES. [2024-11-22 21:32:05,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14214 conditions, 5327 events. 3561/5327 cut-off events. For 3900/3900 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 29434 event pairs, 149 based on Foata normal form. 204/5518 useless extension candidates. Maximal degree in co-relation 14201. Up to 1801 conditions per place. [2024-11-22 21:32:05,805 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 77 selfloop transitions, 14 changer transitions 1/104 dead transitions. [2024-11-22 21:32:05,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 104 transitions, 539 flow [2024-11-22 21:32:05,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:32:05,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:32:05,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2024-11-22 21:32:05,806 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-11-22 21:32:05,806 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 187 flow. Second operand 6 states and 196 transitions. [2024-11-22 21:32:05,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 104 transitions, 539 flow [2024-11-22 21:32:05,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 509 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-22 21:32:05,815 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 237 flow [2024-11-22 21:32:05,815 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, 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-11-22 21:32:05,816 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -37 predicate places. [2024-11-22 21:32:05,816 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 237 flow [2024-11-22 21:32:05,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:05,816 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:05,816 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:32:05,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 21:32:05,817 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:32:05,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:05,817 INFO L85 PathProgramCache]: Analyzing trace with hash -413350344, now seen corresponding path program 1 times [2024-11-22 21:32:05,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:32:05,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117061373] [2024-11-22 21:32:05,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:32:05,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:32:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:32:06,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:06,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:32:06,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117061373] [2024-11-22 21:32:06,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117061373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:06,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:06,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:32:06,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876834199] [2024-11-22 21:32:06,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:06,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:32:06,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:32:06,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:32:06,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:32:06,091 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 96 [2024-11-22 21:32:06,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:06,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:06,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 96 [2024-11-22 21:32:06,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:06,557 INFO L124 PetriNetUnfolderBase]: 2205/3207 cut-off events. [2024-11-22 21:32:06,558 INFO L125 PetriNetUnfolderBase]: For 4072/4072 co-relation queries the response was YES. [2024-11-22 21:32:06,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9583 conditions, 3207 events. 2205/3207 cut-off events. For 4072/4072 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 15616 event pairs, 103 based on Foata normal form. 88/3282 useless extension candidates. Maximal degree in co-relation 9569. Up to 1020 conditions per place. [2024-11-22 21:32:06,574 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 69 selfloop transitions, 18 changer transitions 1/100 dead transitions. [2024-11-22 21:32:06,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 531 flow [2024-11-22 21:32:06,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:32:06,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:32:06,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 209 transitions. [2024-11-22 21:32:06,576 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.31101190476190477 [2024-11-22 21:32:06,576 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 237 flow. Second operand 7 states and 209 transitions. [2024-11-22 21:32:06,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 531 flow [2024-11-22 21:32:06,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 100 transitions, 485 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-22 21:32:06,593 INFO L231 Difference]: Finished difference. Result has 69 places, 52 transitions, 247 flow [2024-11-22 21:32:06,593 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, 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-11-22 21:32:06,594 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -34 predicate places. [2024-11-22 21:32:06,594 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 52 transitions, 247 flow [2024-11-22 21:32:06,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:06,594 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:06,595 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-11-22 21:32:06,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 21:32:06,595 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:32:06,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:06,595 INFO L85 PathProgramCache]: Analyzing trace with hash -46121045, now seen corresponding path program 1 times [2024-11-22 21:32:06,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:32:06,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652456272] [2024-11-22 21:32:06,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:32:06,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:32:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:32:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:06,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:32:06,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652456272] [2024-11-22 21:32:06,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652456272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:06,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:06,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:32:06,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183857920] [2024-11-22 21:32:06,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:06,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:32:06,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:32:06,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:32:06,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:32:06,900 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 96 [2024-11-22 21:32:06,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 52 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:06,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:06,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 96 [2024-11-22 21:32:06,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:07,603 INFO L124 PetriNetUnfolderBase]: 2814/4699 cut-off events. [2024-11-22 21:32:07,603 INFO L125 PetriNetUnfolderBase]: For 2487/2589 co-relation queries the response was YES. [2024-11-22 21:32:07,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11778 conditions, 4699 events. 2814/4699 cut-off events. For 2487/2589 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 30436 event pairs, 489 based on Foata normal form. 16/4503 useless extension candidates. Maximal degree in co-relation 11763. Up to 1648 conditions per place. [2024-11-22 21:32:07,633 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 42 selfloop transitions, 3 changer transitions 18/90 dead transitions. [2024-11-22 21:32:07,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 90 transitions, 469 flow [2024-11-22 21:32:07,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:32:07,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:32:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2024-11-22 21:32:07,638 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3194444444444444 [2024-11-22 21:32:07,638 INFO L175 Difference]: Start difference. First operand has 69 places, 52 transitions, 247 flow. Second operand 6 states and 184 transitions. [2024-11-22 21:32:07,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 90 transitions, 469 flow [2024-11-22 21:32:07,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 90 transitions, 363 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-11-22 21:32:07,661 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 169 flow [2024-11-22 21:32:07,661 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, 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-11-22 21:32:07,662 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -36 predicate places. [2024-11-22 21:32:07,662 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 169 flow [2024-11-22 21:32:07,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:07,662 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:07,662 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-11-22 21:32:07,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 21:32:07,663 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:32:07,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:07,663 INFO L85 PathProgramCache]: Analyzing trace with hash 118198059, now seen corresponding path program 2 times [2024-11-22 21:32:07,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:32:07,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951386871] [2024-11-22 21:32:07,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:32:07,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:32:07,791 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:32:07,791 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:32:09,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:09,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:32:09,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951386871] [2024-11-22 21:32:09,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951386871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:09,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:09,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 21:32:09,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104822328] [2024-11-22 21:32:09,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:09,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 21:32:09,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:32:09,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 21:32:09,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-22 21:32:09,928 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 96 [2024-11-22 21:32:09,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 169 flow. Second operand has 10 states, 10 states have (on average 23.9) internal successors, (239), 10 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:09,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:09,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 96 [2024-11-22 21:32:09,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:10,648 INFO L124 PetriNetUnfolderBase]: 3012/5000 cut-off events. [2024-11-22 21:32:10,648 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-22 21:32:10,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10728 conditions, 5000 events. 3012/5000 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 33435 event pairs, 162 based on Foata normal form. 16/4677 useless extension candidates. Maximal degree in co-relation 10715. Up to 1884 conditions per place. [2024-11-22 21:32:10,668 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 37 selfloop transitions, 6 changer transitions 14/87 dead transitions. [2024-11-22 21:32:10,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 87 transitions, 361 flow [2024-11-22 21:32:10,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:32:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:32:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 234 transitions. [2024-11-22 21:32:10,670 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3046875 [2024-11-22 21:32:10,670 INFO L175 Difference]: Start difference. First operand has 67 places, 53 transitions, 169 flow. Second operand 8 states and 234 transitions. [2024-11-22 21:32:10,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 87 transitions, 361 flow [2024-11-22 21:32:10,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 87 transitions, 351 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-22 21:32:10,672 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 186 flow [2024-11-22 21:32:10,672 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=186, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2024-11-22 21:32:10,672 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -32 predicate places. [2024-11-22 21:32:10,672 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 186 flow [2024-11-22 21:32:10,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.9) internal successors, (239), 10 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:10,673 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:10,673 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-11-22 21:32:10,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 21:32:10,673 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:32:10,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:10,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1442933615, now seen corresponding path program 3 times [2024-11-22 21:32:10,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:32:10,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714052493] [2024-11-22 21:32:10,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:32:10,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:32:10,757 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 21:32:10,758 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 21:32:10,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:32:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:32:10,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 21:32:10,868 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:32:10,868 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (79 of 80 remaining) [2024-11-22 21:32:10,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 80 remaining) [2024-11-22 21:32:10,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 80 remaining) [2024-11-22 21:32:10,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 80 remaining) [2024-11-22 21:32:10,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 80 remaining) [2024-11-22 21:32:10,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 80 remaining) [2024-11-22 21:32:10,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 80 remaining) [2024-11-22 21:32:10,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 80 remaining) [2024-11-22 21:32:10,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 80 remaining) [2024-11-22 21:32:10,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 80 remaining) [2024-11-22 21:32:10,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 80 remaining) [2024-11-22 21:32:10,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 80 remaining) [2024-11-22 21:32:10,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 80 remaining) [2024-11-22 21:32:10,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 80 remaining) [2024-11-22 21:32:10,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 80 remaining) [2024-11-22 21:32:10,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 80 remaining) [2024-11-22 21:32:10,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 80 remaining) [2024-11-22 21:32:10,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 80 remaining) [2024-11-22 21:32:10,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 80 remaining) [2024-11-22 21:32:10,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 80 remaining) [2024-11-22 21:32:10,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 80 remaining) [2024-11-22 21:32:10,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 80 remaining) [2024-11-22 21:32:10,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 80 remaining) [2024-11-22 21:32:10,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 80 remaining) [2024-11-22 21:32:10,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 80 remaining) [2024-11-22 21:32:10,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 80 remaining) [2024-11-22 21:32:10,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 80 remaining) [2024-11-22 21:32:10,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 80 remaining) [2024-11-22 21:32:10,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 80 remaining) [2024-11-22 21:32:10,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 80 remaining) [2024-11-22 21:32:10,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 80 remaining) [2024-11-22 21:32:10,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 80 remaining) [2024-11-22 21:32:10,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 80 remaining) [2024-11-22 21:32:10,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 80 remaining) [2024-11-22 21:32:10,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 80 remaining) [2024-11-22 21:32:10,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 80 remaining) [2024-11-22 21:32:10,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 80 remaining) [2024-11-22 21:32:10,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 80 remaining) [2024-11-22 21:32:10,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 80 remaining) [2024-11-22 21:32:10,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 80 remaining) [2024-11-22 21:32:10,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 80 remaining) [2024-11-22 21:32:10,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 80 remaining) [2024-11-22 21:32:10,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 80 remaining) [2024-11-22 21:32:10,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 80 remaining) [2024-11-22 21:32:10,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 80 remaining) [2024-11-22 21:32:10,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 80 remaining) [2024-11-22 21:32:10,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 80 remaining) [2024-11-22 21:32:10,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (32 of 80 remaining) [2024-11-22 21:32:10,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 80 remaining) [2024-11-22 21:32:10,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 80 remaining) [2024-11-22 21:32:10,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 80 remaining) [2024-11-22 21:32:10,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 80 remaining) [2024-11-22 21:32:10,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 80 remaining) [2024-11-22 21:32:10,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 80 remaining) [2024-11-22 21:32:10,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 80 remaining) [2024-11-22 21:32:10,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 80 remaining) [2024-11-22 21:32:10,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 80 remaining) [2024-11-22 21:32:10,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 80 remaining) [2024-11-22 21:32:10,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 80 remaining) [2024-11-22 21:32:10,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 80 remaining) [2024-11-22 21:32:10,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 80 remaining) [2024-11-22 21:32:10,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 80 remaining) [2024-11-22 21:32:10,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 80 remaining) [2024-11-22 21:32:10,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 80 remaining) [2024-11-22 21:32:10,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 80 remaining) [2024-11-22 21:32:10,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 80 remaining) [2024-11-22 21:32:10,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 80 remaining) [2024-11-22 21:32:10,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 80 remaining) [2024-11-22 21:32:10,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 80 remaining) [2024-11-22 21:32:10,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 80 remaining) [2024-11-22 21:32:10,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 80 remaining) [2024-11-22 21:32:10,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 80 remaining) [2024-11-22 21:32:10,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 80 remaining) [2024-11-22 21:32:10,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 80 remaining) [2024-11-22 21:32:10,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 80 remaining) [2024-11-22 21:32:10,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 80 remaining) [2024-11-22 21:32:10,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 80 remaining) [2024-11-22 21:32:10,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 80 remaining) [2024-11-22 21:32:10,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 80 remaining) [2024-11-22 21:32:10,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 80 remaining) [2024-11-22 21:32:10,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 21:32:10,879 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:32:10,977 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 21:32:10,977 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 21:32:10,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:32:10 BasicIcfg [2024-11-22 21:32:10,982 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 21:32:10,982 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 21:32:10,982 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 21:32:10,982 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 21:32:10,982 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:31:52" (3/4) ... [2024-11-22 21:32:10,984 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 21:32:10,984 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 21:32:10,985 INFO L158 Benchmark]: Toolchain (without parser) took 20147.13ms. Allocated memory was 140.5MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 67.4MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-22 21:32:10,985 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 140.5MB. Free memory is still 93.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:32:10,985 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.79ms. Allocated memory is still 140.5MB. Free memory was 67.2MB in the beginning and 91.9MB in the end (delta: -24.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 21:32:10,985 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.99ms. Allocated memory is still 140.5MB. Free memory was 91.9MB in the beginning and 89.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:32:10,985 INFO L158 Benchmark]: Boogie Preprocessor took 54.47ms. Allocated memory is still 140.5MB. Free memory was 89.3MB in the beginning and 84.3MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 21:32:10,985 INFO L158 Benchmark]: RCFGBuilder took 1240.46ms. Allocated memory was 140.5MB in the beginning and 192.9MB in the end (delta: 52.4MB). Free memory was 84.3MB in the beginning and 74.3MB in the end (delta: 10.0MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. [2024-11-22 21:32:10,986 INFO L158 Benchmark]: TraceAbstraction took 18296.50ms. Allocated memory was 192.9MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 73.3MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-22 21:32:10,986 INFO L158 Benchmark]: Witness Printer took 2.32ms. Allocated memory is still 4.7GB. Free memory is still 3.3GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:32:10,987 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.15ms. Allocated memory is still 140.5MB. Free memory is still 93.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 505.79ms. Allocated memory is still 140.5MB. Free memory was 67.2MB in the beginning and 91.9MB in the end (delta: -24.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.99ms. Allocated memory is still 140.5MB. Free memory was 91.9MB in the beginning and 89.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.47ms. Allocated memory is still 140.5MB. Free memory was 89.3MB in the beginning and 84.3MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1240.46ms. Allocated memory was 140.5MB in the beginning and 192.9MB in the end (delta: 52.4MB). Free memory was 84.3MB in the beginning and 74.3MB in the end (delta: 10.0MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. * TraceAbstraction took 18296.50ms. Allocated memory was 192.9MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 73.3MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 2.32ms. Allocated memory is still 4.7GB. Free memory is still 3.3GB. 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; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L741] 0 int y = 0; [L742] 0 _Bool y$flush_delayed; [L743] 0 int y$mem_tmp; [L744] 0 _Bool y$r_buff0_thd0; [L745] 0 _Bool y$r_buff0_thd1; [L746] 0 _Bool y$r_buff0_thd2; [L747] 0 _Bool y$r_buff0_thd3; [L748] 0 _Bool y$r_buff0_thd4; [L749] 0 _Bool y$r_buff1_thd0; [L750] 0 _Bool y$r_buff1_thd1; [L751] 0 _Bool y$r_buff1_thd2; [L752] 0 _Bool y$r_buff1_thd3; [L753] 0 _Bool y$r_buff1_thd4; [L754] 0 _Bool y$read_delayed; [L755] 0 int *y$read_delayed_var; [L756] 0 int y$w_buff0; [L757] 0 _Bool y$w_buff0_used; [L758] 0 int y$w_buff1; [L759] 0 _Bool y$w_buff1_used; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2225; [L855] FCALL, FORK 0 pthread_create(&t2225, ((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, main$tmp_guard0=0, main$tmp_guard1=0, t2225=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}] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 y$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(y) [L769] 1 y$mem_tmp = y [L770] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L771] 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)))) [L771] EXPR 1 \read(y) [L771] 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)))) [L771] 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)))) [L772] 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)))) [L773] 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)))) [L774] 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)))) [L775] 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)))) [L776] 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)))) [L777] 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)))) [L778] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L779] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L780] EXPR 1 \read(y) [L780] 1 __unbuffered_p0_EAX = y [L781] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L781] EXPR 1 \read(y) [L781] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L781] 1 y = y$flush_delayed ? y$mem_tmp : y [L782] 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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, 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}] [L785] 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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, 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}] [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\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=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, 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}] [L856] 0 pthread_t t2226; [L857] FCALL, FORK 0 pthread_create(&t2226, ((void *)0), P1, ((void *)0)) VAL [\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=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2225=0, t2226=1, weak$$choice0=1, weak$$choice1=1, 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}] [L797] 2 x = 1 VAL [\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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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}] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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}] [L858] 0 pthread_t t2227; [L859] FCALL, FORK 0 pthread_create(&t2227, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2225=0, t2226=1, t2227=2, weak$$choice0=1, 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}] [L860] 0 pthread_t t2228; [L861] FCALL, FORK 0 pthread_create(&t2228, ((void *)0), P3, ((void *)0)) 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2225=0, t2226=1, t2227=2, t2228=3, weak$$choice0=1, 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}] [L809] 3 __unbuffered_p2_EAX = x 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, 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=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}] [L812] 3 y = 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, 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=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}] [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 \read(y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \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, 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=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}] [L829] 4 y = 2 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, 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=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] 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) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 \read(y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] 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) [L832] 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) [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] 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 [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] 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=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, 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=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 __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, 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=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}] [L822] 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, 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=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}] [L863] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2225=0, t2226=1, t2227=2, t2228=3, weak$$choice0=1, 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}] [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] 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) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 \read(y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] 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) [L867] 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) [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] 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 [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2225=0, t2226=1, t2227=2, t2228=3, weak$$choice0=1, 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}] [L874] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 0 y$flush_delayed = weak$$choice2 [L877] EXPR 0 \read(y) [L877] 0 y$mem_tmp = y [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] EXPR 0 \read(y) [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L879] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L880] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L881] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L882] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L884] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L887] EXPR 0 \read(y) [L887] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] 0 y = y$flush_delayed ? y$mem_tmp : y [L889] 0 y$flush_delayed = (_Bool)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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2225=0, t2226=1, t2227=2, t2228=3, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, 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}] [L891] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=2, 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", "safe019_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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=2, 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: -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: 852]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 861]: 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: 857]: 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: 859]: 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: 18.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 705 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 687 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1091 IncrementalHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 1 mSDtfsCounter, 1091 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=10, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 1359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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-11-22 21:32:11,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe019_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 e9fa0a1b11704376245a2fedbc5c4fb7e02255cba008bc8067c3e06529a17976 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:32:13,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:32:13,496 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 21:32:13,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:32:13,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:32:13,524 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:32:13,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:32:13,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:32:13,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:32:13,528 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:32:13,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:32:13,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:32:13,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:32:13,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:32:13,529 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:32:13,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:32:13,530 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:32:13,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:32:13,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:32:13,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:32:13,531 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:32:13,531 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:32:13,532 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:32:13,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:32:13,532 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:32:13,532 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 21:32:13,533 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:32:13,533 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 21:32:13,533 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:32:13,533 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:32:13,533 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:32:13,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:32:13,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:32:13,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:32:13,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:32:13,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:32:13,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:32:13,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:32:13,535 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 21:32:13,535 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 21:32:13,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:32:13,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:32:13,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:32:13,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:32:13,536 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 -> e9fa0a1b11704376245a2fedbc5c4fb7e02255cba008bc8067c3e06529a17976 [2024-11-22 21:32:13,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:32:13,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:32:13,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:32:13,804 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:32:13,804 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:32:13,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i [2024-11-22 21:32:15,069 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:32:15,282 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:32:15,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i [2024-11-22 21:32:15,302 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17e0a25a/bd841efbd0264775b26654ee44e7cbb8/FLAG060fa482b [2024-11-22 21:32:15,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17e0a25a/bd841efbd0264775b26654ee44e7cbb8 [2024-11-22 21:32:15,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:32:15,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:32:15,322 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:32:15,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:32:15,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:32:15,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:32:15" (1/1) ... [2024-11-22 21:32:15,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70ee0e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:15, skipping insertion in model container [2024-11-22 21:32:15,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:32:15" (1/1) ... [2024-11-22 21:32:15,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:32:15,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:32:15,717 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:32:15,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:32:15,799 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:32:15,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:15 WrapperNode [2024-11-22 21:32:15,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:32:15,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:32:15,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:32:15,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:32:15,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:15" (1/1) ... [2024-11-22 21:32:15,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:15" (1/1) ... [2024-11-22 21:32:15,863 INFO L138 Inliner]: procedures = 180, calls = 72, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 174 [2024-11-22 21:32:15,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:32:15,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:32:15,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:32:15,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:32:15,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:15" (1/1) ... [2024-11-22 21:32:15,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:15" (1/1) ... [2024-11-22 21:32:15,887 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:15" (1/1) ... [2024-11-22 21:32:15,929 INFO L175 MemorySlicer]: Split 26 memory accesses to 2 slices as follows [2, 24]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 9 writes are split as follows [0, 9]. [2024-11-22 21:32:15,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:15" (1/1) ... [2024-11-22 21:32:15,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:15" (1/1) ... [2024-11-22 21:32:15,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:15" (1/1) ... [2024-11-22 21:32:15,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:15" (1/1) ... [2024-11-22 21:32:15,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:15" (1/1) ... [2024-11-22 21:32:15,955 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:15" (1/1) ... [2024-11-22 21:32:15,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:32:15,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:32:15,964 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:32:15,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:32:15,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:15" (1/1) ... [2024-11-22 21:32:15,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:32:15,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:32:16,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 21:32:16,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 21:32:16,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 21:32:16,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 21:32:16,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 21:32:16,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:32:16,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 21:32:16,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 21:32:16,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 21:32:16,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 21:32:16,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-22 21:32:16,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-22 21:32:16,044 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-22 21:32:16,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-22 21:32:16,045 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-22 21:32:16,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-22 21:32:16,045 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-22 21:32:16,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-22 21:32:16,045 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-22 21:32:16,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-22 21:32:16,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 21:32:16,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:32:16,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:32:16,047 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:32:16,178 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:32:16,179 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:32:16,692 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:32:16,692 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:32:17,272 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:32:17,273 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 21:32:17,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:32:17 BoogieIcfgContainer [2024-11-22 21:32:17,274 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:32:17,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:32:17,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:32:17,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:32:17,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:32:15" (1/3) ... [2024-11-22 21:32:17,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670e78f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:32:17, skipping insertion in model container [2024-11-22 21:32:17,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:15" (2/3) ... [2024-11-22 21:32:17,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670e78f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:32:17, skipping insertion in model container [2024-11-22 21:32:17,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:32:17" (3/3) ... [2024-11-22 21:32:17,280 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.oepc.i [2024-11-22 21:32:17,294 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:32:17,295 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2024-11-22 21:32:17,295 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:32:17,431 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:32:17,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 96 transitions, 208 flow [2024-11-22 21:32:17,495 INFO L124 PetriNetUnfolderBase]: 2/92 cut-off events. [2024-11-22 21:32:17,495 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:32:17,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 381 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2024-11-22 21:32:17,501 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 96 transitions, 208 flow [2024-11-22 21:32:17,504 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 92 transitions, 196 flow [2024-11-22 21:32:17,511 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:32:17,517 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;@42fb1622, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:32:17,517 INFO L334 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2024-11-22 21:32:17,521 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:32:17,522 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-22 21:32:17,522 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:32:17,522 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:17,523 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-22 21:32:17,523 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:32:17,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:17,527 INFO L85 PathProgramCache]: Analyzing trace with hash 29828063, now seen corresponding path program 1 times [2024-11-22 21:32:17,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:17,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93176151] [2024-11-22 21:32:17,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:32:17,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:17,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:17,541 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:32:17,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 21:32:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:32:17,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:32:17,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:32:17,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:17,720 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:32:17,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:32:17,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93176151] [2024-11-22 21:32:17,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [93176151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:17,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:17,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:32:17,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859703004] [2024-11-22 21:32:17,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:17,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:32:17,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:32:17,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:32:17,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:32:17,760 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 96 [2024-11-22 21:32:17,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 92 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:17,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:17,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 96 [2024-11-22 21:32:17,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:21,471 INFO L124 PetriNetUnfolderBase]: 16139/23720 cut-off events. [2024-11-22 21:32:21,471 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-22 21:32:21,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45628 conditions, 23720 events. 16139/23720 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 2075. Compared 190200 event pairs, 16139 based on Foata normal form. 784/16291 useless extension candidates. Maximal degree in co-relation 45616. Up to 21764 conditions per place. [2024-11-22 21:32:21,656 INFO L140 encePairwiseOnDemand]: 59/96 looper letters, 36 selfloop transitions, 1 changer transitions 0/55 dead transitions. [2024-11-22 21:32:21,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 55 transitions, 196 flow [2024-11-22 21:32:21,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:32:21,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:32:21,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2024-11-22 21:32:21,666 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4826388888888889 [2024-11-22 21:32:21,668 INFO L175 Difference]: Start difference. First operand has 103 places, 92 transitions, 196 flow. Second operand 3 states and 139 transitions. [2024-11-22 21:32:21,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 55 transitions, 196 flow [2024-11-22 21:32:21,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 55 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-22 21:32:21,674 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 120 flow [2024-11-22 21:32:21,675 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2024-11-22 21:32:21,678 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -37 predicate places. [2024-11-22 21:32:21,678 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 120 flow [2024-11-22 21:32:21,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:21,679 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:21,679 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-22 21:32:21,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-22 21:32:21,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:21,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:32:21,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:21,886 INFO L85 PathProgramCache]: Analyzing trace with hash 29828064, now seen corresponding path program 1 times [2024-11-22 21:32:21,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:21,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959515297] [2024-11-22 21:32:21,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:32:21,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:21,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:21,891 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:32:21,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 21:32:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:32:22,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 21:32:22,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:32:22,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:22,077 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:32:22,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:32:22,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959515297] [2024-11-22 21:32:22,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959515297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:22,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:22,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:32:22,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813167350] [2024-11-22 21:32:22,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:22,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:32:22,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:32:22,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:32:22,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:32:22,080 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 96 [2024-11-22 21:32:22,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:22,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:22,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 96 [2024-11-22 21:32:22,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:23,054 INFO L124 PetriNetUnfolderBase]: 2831/4522 cut-off events. [2024-11-22 21:32:23,055 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:32:23,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8548 conditions, 4522 events. 2831/4522 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 32642 event pairs, 2831 based on Foata normal form. 0/4300 useless extension candidates. Maximal degree in co-relation 8542. Up to 3954 conditions per place. [2024-11-22 21:32:23,083 INFO L140 encePairwiseOnDemand]: 85/96 looper letters, 25 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2024-11-22 21:32:23,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 154 flow [2024-11-22 21:32:23,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:32:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:32:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-11-22 21:32:23,085 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3576388888888889 [2024-11-22 21:32:23,085 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 120 flow. Second operand 3 states and 103 transitions. [2024-11-22 21:32:23,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 154 flow [2024-11-22 21:32:23,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 45 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:32:23,087 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 99 flow [2024-11-22 21:32:23,087 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, 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-11-22 21:32:23,087 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -46 predicate places. [2024-11-22 21:32:23,088 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 99 flow [2024-11-22 21:32:23,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:23,088 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:23,088 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:32:23,098 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-11-22 21:32:23,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:23,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:32:23,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:23,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1585211128, now seen corresponding path program 1 times [2024-11-22 21:32:23,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:23,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519146031] [2024-11-22 21:32:23,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:32:23,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:23,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:23,296 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:32:23,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 21:32:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:32:23,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:32:23,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:32:23,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:23,520 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:32:23,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:32:23,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519146031] [2024-11-22 21:32:23,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519146031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:23,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:23,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:32:23,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586303093] [2024-11-22 21:32:23,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:23,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:32:23,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:32:23,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:32:23,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:32:23,533 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 96 [2024-11-22 21:32:23,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:23,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:23,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 96 [2024-11-22 21:32:23,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:25,234 INFO L124 PetriNetUnfolderBase]: 9937/14673 cut-off events. [2024-11-22 21:32:25,235 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:32:25,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28360 conditions, 14673 events. 9937/14673 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 99308 event pairs, 770 based on Foata normal form. 300/14401 useless extension candidates. Maximal degree in co-relation 28353. Up to 10036 conditions per place. [2024-11-22 21:32:25,305 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 54 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2024-11-22 21:32:25,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 287 flow [2024-11-22 21:32:25,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:32:25,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:32:25,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2024-11-22 21:32:25,307 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3411458333333333 [2024-11-22 21:32:25,307 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 99 flow. Second operand 4 states and 131 transitions. [2024-11-22 21:32:25,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 287 flow [2024-11-22 21:32:25,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 286 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:32:25,309 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 140 flow [2024-11-22 21:32:25,309 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, 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-11-22 21:32:25,310 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -43 predicate places. [2024-11-22 21:32:25,310 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 140 flow [2024-11-22 21:32:25,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:25,310 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:25,310 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:32:25,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-22 21:32:25,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:25,511 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:32:25,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:25,512 INFO L85 PathProgramCache]: Analyzing trace with hash 813812490, now seen corresponding path program 1 times [2024-11-22 21:32:25,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:25,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717139150] [2024-11-22 21:32:25,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:32:25,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:25,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:25,516 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:32:25,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 21:32:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:32:25,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 21:32:25,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:32:25,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:25,668 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:32:25,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:32:25,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717139150] [2024-11-22 21:32:25,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717139150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:25,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:25,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:32:25,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060267585] [2024-11-22 21:32:25,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:25,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:32:25,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:32:25,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:32:25,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:32:25,677 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 96 [2024-11-22 21:32:25,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:25,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:25,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 96 [2024-11-22 21:32:25,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:26,909 INFO L124 PetriNetUnfolderBase]: 7486/11190 cut-off events. [2024-11-22 21:32:26,909 INFO L125 PetriNetUnfolderBase]: For 2530/2534 co-relation queries the response was YES. [2024-11-22 21:32:26,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25005 conditions, 11190 events. 7486/11190 cut-off events. For 2530/2534 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 72653 event pairs, 294 based on Foata normal form. 284/11058 useless extension candidates. Maximal degree in co-relation 24995. Up to 6877 conditions per place. [2024-11-22 21:32:26,967 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 68 selfloop transitions, 10 changer transitions 1/92 dead transitions. [2024-11-22 21:32:26,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 92 transitions, 415 flow [2024-11-22 21:32:26,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:32:26,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:32:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2024-11-22 21:32:26,971 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3458333333333333 [2024-11-22 21:32:26,971 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 140 flow. Second operand 5 states and 166 transitions. [2024-11-22 21:32:26,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 92 transitions, 415 flow [2024-11-22 21:32:26,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 92 transitions, 404 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-22 21:32:26,975 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 192 flow [2024-11-22 21:32:26,975 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, 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-11-22 21:32:26,975 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -39 predicate places. [2024-11-22 21:32:26,975 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 192 flow [2024-11-22 21:32:26,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:26,976 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:26,976 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:32:26,981 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 (5)] Ended with exit code 0 [2024-11-22 21:32:27,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:27,177 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:32:27,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:27,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1872385628, now seen corresponding path program 1 times [2024-11-22 21:32:27,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:27,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782109806] [2024-11-22 21:32:27,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:32:27,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:27,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:27,179 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:32:27,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 21:32:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:32:27,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:32:27,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:32:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:27,331 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:32:27,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:32:27,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782109806] [2024-11-22 21:32:27,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782109806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:27,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:27,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:32:27,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024684461] [2024-11-22 21:32:27,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:27,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:32:27,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:32:27,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:32:27,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:32:27,342 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 96 [2024-11-22 21:32:27,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:27,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:27,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 96 [2024-11-22 21:32:27,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:28,516 INFO L124 PetriNetUnfolderBase]: 4197/6315 cut-off events. [2024-11-22 21:32:28,517 INFO L125 PetriNetUnfolderBase]: For 4199/4207 co-relation queries the response was YES. [2024-11-22 21:32:28,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15749 conditions, 6315 events. 4197/6315 cut-off events. For 4199/4207 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 35995 event pairs, 149 based on Foata normal form. 208/6339 useless extension candidates. Maximal degree in co-relation 15737. Up to 2701 conditions per place. [2024-11-22 21:32:28,547 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 80 selfloop transitions, 14 changer transitions 1/108 dead transitions. [2024-11-22 21:32:28,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 108 transitions, 542 flow [2024-11-22 21:32:28,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:32:28,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:32:28,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2024-11-22 21:32:28,549 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3454861111111111 [2024-11-22 21:32:28,549 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 192 flow. Second operand 6 states and 199 transitions. [2024-11-22 21:32:28,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 108 transitions, 542 flow [2024-11-22 21:32:28,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 108 transitions, 512 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-22 21:32:28,562 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 242 flow [2024-11-22 21:32:28,563 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, 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-11-22 21:32:28,565 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -36 predicate places. [2024-11-22 21:32:28,565 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 242 flow [2024-11-22 21:32:28,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:28,565 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:28,566 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-11-22 21:32:28,571 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 (6)] Forceful destruction successful, exit code 0 [2024-11-22 21:32:28,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:28,770 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:32:28,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:28,770 INFO L85 PathProgramCache]: Analyzing trace with hash -444411816, now seen corresponding path program 1 times [2024-11-22 21:32:28,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:28,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511960410] [2024-11-22 21:32:28,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:32:28,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:28,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:28,773 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:32:28,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 21:32:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:32:28,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:32:28,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:32:28,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:28,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:32:28,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:32:28,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511960410] [2024-11-22 21:32:28,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511960410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:28,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:28,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:32:28,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053082472] [2024-11-22 21:32:28,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:28,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:32:28,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:32:28,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:32:28,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:32:28,979 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 96 [2024-11-22 21:32:28,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 242 flow. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:28,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:28,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 96 [2024-11-22 21:32:28,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:29,790 INFO L124 PetriNetUnfolderBase]: 2301/3367 cut-off events. [2024-11-22 21:32:29,791 INFO L125 PetriNetUnfolderBase]: For 4086/4094 co-relation queries the response was YES. [2024-11-22 21:32:29,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9494 conditions, 3367 events. 2301/3367 cut-off events. For 4086/4094 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 16525 event pairs, 103 based on Foata normal form. 92/3419 useless extension candidates. Maximal degree in co-relation 9481. Up to 1020 conditions per place. [2024-11-22 21:32:29,808 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 72 selfloop transitions, 18 changer transitions 1/104 dead transitions. [2024-11-22 21:32:29,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 104 transitions, 536 flow [2024-11-22 21:32:29,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:32:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:32:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 212 transitions. [2024-11-22 21:32:29,810 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.31547619047619047 [2024-11-22 21:32:29,810 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 242 flow. Second operand 7 states and 212 transitions. [2024-11-22 21:32:29,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 104 transitions, 536 flow [2024-11-22 21:32:29,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 104 transitions, 490 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-22 21:32:29,826 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 252 flow [2024-11-22 21:32:29,826 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, 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-11-22 21:32:29,827 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -33 predicate places. [2024-11-22 21:32:29,827 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 252 flow [2024-11-22 21:32:29,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:29,828 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:29,828 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-11-22 21:32:29,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-22 21:32:30,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:30,033 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:32:30,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:30,033 INFO L85 PathProgramCache]: Analyzing trace with hash -674580028, now seen corresponding path program 1 times [2024-11-22 21:32:30,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:30,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663630702] [2024-11-22 21:32:30,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:32:30,034 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:30,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:30,037 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:32:30,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-22 21:32:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:32:30,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:32:30,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:32:30,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:30,397 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:32:30,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:32:30,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663630702] [2024-11-22 21:32:30,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663630702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:30,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:30,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:32:30,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833117005] [2024-11-22 21:32:30,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:30,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:32:30,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:32:30,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:32:30,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:32:30,400 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 96 [2024-11-22 21:32:30,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 252 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-11-22 21:32:30,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:30,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 96 [2024-11-22 21:32:30,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:30,797 INFO L124 PetriNetUnfolderBase]: 1195/2167 cut-off events. [2024-11-22 21:32:30,797 INFO L125 PetriNetUnfolderBase]: For 1209/1263 co-relation queries the response was YES. [2024-11-22 21:32:30,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4996 conditions, 2167 events. 1195/2167 cut-off events. For 1209/1263 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13070 event pairs, 463 based on Foata normal form. 0/2044 useless extension candidates. Maximal degree in co-relation 4982. Up to 1278 conditions per place. [2024-11-22 21:32:30,806 INFO L140 encePairwiseOnDemand]: 92/96 looper letters, 36 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2024-11-22 21:32:30,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 68 transitions, 358 flow [2024-11-22 21:32:30,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:32:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:32:30,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2024-11-22 21:32:30,808 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-11-22 21:32:30,808 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 252 flow. Second operand 4 states and 128 transitions. [2024-11-22 21:32:30,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 68 transitions, 358 flow [2024-11-22 21:32:30,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 68 transitions, 262 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-11-22 21:32:30,813 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 156 flow [2024-11-22 21:32:30,813 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=58, 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=156, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2024-11-22 21:32:30,814 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -42 predicate places. [2024-11-22 21:32:30,814 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 156 flow [2024-11-22 21:32:30,814 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-11-22 21:32:30,814 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:30,814 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-11-22 21:32:30,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-22 21:32:31,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:31,015 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:32:31,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:31,016 INFO L85 PathProgramCache]: Analyzing trace with hash -696443360, now seen corresponding path program 1 times [2024-11-22 21:32:31,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:31,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874544097] [2024-11-22 21:32:31,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:32:31,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:31,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:31,019 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:32:31,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 21:32:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:32:31,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 21:32:31,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:32:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:31,204 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:32:31,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:32:31,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874544097] [2024-11-22 21:32:31,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874544097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:31,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:31,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:32:31,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194208894] [2024-11-22 21:32:31,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:31,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:32:31,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:32:31,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:32:31,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:32:31,206 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 96 [2024-11-22 21:32:31,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:31,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:31,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 96 [2024-11-22 21:32:31,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:31,391 INFO L124 PetriNetUnfolderBase]: 1093/1883 cut-off events. [2024-11-22 21:32:31,391 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2024-11-22 21:32:31,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3873 conditions, 1883 events. 1093/1883 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 10756 event pairs, 958 based on Foata normal form. 16/1815 useless extension candidates. Maximal degree in co-relation 3864. Up to 1459 conditions per place. [2024-11-22 21:32:31,399 INFO L140 encePairwiseOnDemand]: 94/96 looper letters, 22 selfloop transitions, 1 changer transitions 1/53 dead transitions. [2024-11-22 21:32:31,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 53 transitions, 202 flow [2024-11-22 21:32:31,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:32:31,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:32:31,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-11-22 21:32:31,400 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3055555555555556 [2024-11-22 21:32:31,400 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 156 flow. Second operand 3 states and 88 transitions. [2024-11-22 21:32:31,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 53 transitions, 202 flow [2024-11-22 21:32:31,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 53 transitions, 199 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:32:31,402 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 151 flow [2024-11-22 21:32:31,403 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=58, 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=151, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2024-11-22 21:32:31,403 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -43 predicate places. [2024-11-22 21:32:31,403 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 151 flow [2024-11-22 21:32:31,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:31,404 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:31,404 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-11-22 21:32:31,409 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 (9)] Forceful destruction successful, exit code 0 [2024-11-22 21:32:31,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:31,609 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:32:31,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:31,609 INFO L85 PathProgramCache]: Analyzing trace with hash -289143367, now seen corresponding path program 1 times [2024-11-22 21:32:31,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:31,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994381211] [2024-11-22 21:32:31,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:32:31,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:31,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:31,612 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-11-22 21:32:31,613 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-11-22 21:32:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:32:31,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:32:31,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:32:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:31,803 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:32:31,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:32:31,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994381211] [2024-11-22 21:32:31,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994381211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:31,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:31,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:32:31,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376934256] [2024-11-22 21:32:31,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:31,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:32:31,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:32:31,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:32:31,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:32:31,818 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 96 [2024-11-22 21:32:31,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:31,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:31,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 96 [2024-11-22 21:32:31,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:32,316 INFO L124 PetriNetUnfolderBase]: 2814/4699 cut-off events. [2024-11-22 21:32:32,316 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:32:32,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9626 conditions, 4699 events. 2814/4699 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 30578 event pairs, 489 based on Foata normal form. 16/4507 useless extension candidates. Maximal degree in co-relation 9617. Up to 1648 conditions per place. [2024-11-22 21:32:32,334 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 42 selfloop transitions, 3 changer transitions 18/90 dead transitions. [2024-11-22 21:32:32,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 90 transitions, 361 flow [2024-11-22 21:32:32,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:32:32,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:32:32,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2024-11-22 21:32:32,335 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3194444444444444 [2024-11-22 21:32:32,335 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 151 flow. Second operand 6 states and 184 transitions. [2024-11-22 21:32:32,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 90 transitions, 361 flow [2024-11-22 21:32:32,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 90 transitions, 360 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:32:32,336 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 168 flow [2024-11-22 21:32:32,337 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=58, 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=168, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2024-11-22 21:32:32,337 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -37 predicate places. [2024-11-22 21:32:32,337 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 168 flow [2024-11-22 21:32:32,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:32,337 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:32,337 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-11-22 21:32:32,343 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 (10)] Forceful destruction successful, exit code 0 [2024-11-22 21:32:32,541 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-11-22 21:32:32,541 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:32:32,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:32,542 INFO L85 PathProgramCache]: Analyzing trace with hash 187162237, now seen corresponding path program 2 times [2024-11-22 21:32:32,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:32,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216935659] [2024-11-22 21:32:32,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:32:32,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:32,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:32,544 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-11-22 21:32:32,545 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-11-22 21:32:32,691 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:32:32,692 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:32:32,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:32:32,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:32:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:32,744 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:32:32,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:32:32,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216935659] [2024-11-22 21:32:32,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1216935659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:32,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:32,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:32:32,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729230886] [2024-11-22 21:32:32,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:32,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:32:32,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:32:32,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:32:32,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:32:32,753 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 96 [2024-11-22 21:32:32,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 168 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:32,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:32,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 96 [2024-11-22 21:32:32,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:33,683 INFO L124 PetriNetUnfolderBase]: 4857/8185 cut-off events. [2024-11-22 21:32:33,683 INFO L125 PetriNetUnfolderBase]: For 708/708 co-relation queries the response was YES. [2024-11-22 21:32:33,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16799 conditions, 8185 events. 4857/8185 cut-off events. For 708/708 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 59356 event pairs, 1215 based on Foata normal form. 16/7706 useless extension candidates. Maximal degree in co-relation 16786. Up to 3383 conditions per place. [2024-11-22 21:32:33,706 INFO L140 encePairwiseOnDemand]: 91/96 looper letters, 34 selfloop transitions, 1 changer transitions 29/92 dead transitions. [2024-11-22 21:32:33,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 92 transitions, 387 flow [2024-11-22 21:32:33,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:32:33,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:32:33,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2024-11-22 21:32:33,708 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3211805555555556 [2024-11-22 21:32:33,708 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 168 flow. Second operand 6 states and 185 transitions. [2024-11-22 21:32:33,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 92 transitions, 387 flow [2024-11-22 21:32:33,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 92 transitions, 377 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-22 21:32:33,710 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 171 flow [2024-11-22 21:32:33,710 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=60, 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=6, PETRI_FLOW=171, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2024-11-22 21:32:33,710 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -34 predicate places. [2024-11-22 21:32:33,711 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 171 flow [2024-11-22 21:32:33,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:33,711 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:33,711 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-11-22 21:32:33,716 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-11-22 21:32:33,911 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-11-22 21:32:33,912 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:32:33,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:33,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1537487589, now seen corresponding path program 3 times [2024-11-22 21:32:33,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:33,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132617012] [2024-11-22 21:32:33,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:32:33,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:33,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:33,916 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-11-22 21:32:33,917 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-11-22 21:32:34,062 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 21:32:34,062 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:32:34,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-22 21:32:34,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:32:34,234 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-11-22 21:32:34,267 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-11-22 21:32:34,457 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-11-22 21:32:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:34,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:32:34,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:32:34,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132617012] [2024-11-22 21:32:34,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132617012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:34,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:34,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:32:34,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418293734] [2024-11-22 21:32:34,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:34,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:32:34,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:32:34,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:32:34,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:32:34,519 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 96 [2024-11-22 21:32:34,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 171 flow. Second operand has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:34,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:34,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 96 [2024-11-22 21:32:34,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:35,270 INFO L124 PetriNetUnfolderBase]: 3560/5984 cut-off events. [2024-11-22 21:32:35,270 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-11-22 21:32:35,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12463 conditions, 5984 events. 3560/5984 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 42637 event pairs, 1190 based on Foata normal form. 16/5424 useless extension candidates. Maximal degree in co-relation 12449. Up to 2773 conditions per place. [2024-11-22 21:32:35,299 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 29 selfloop transitions, 5 changer transitions 12/76 dead transitions. [2024-11-22 21:32:35,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 76 transitions, 318 flow [2024-11-22 21:32:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:32:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:32:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2024-11-22 21:32:35,301 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3107638888888889 [2024-11-22 21:32:35,301 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 171 flow. Second operand 6 states and 179 transitions. [2024-11-22 21:32:35,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 76 transitions, 318 flow [2024-11-22 21:32:35,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 76 transitions, 307 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-22 21:32:35,303 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 197 flow [2024-11-22 21:32:35,303 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2024-11-22 21:32:35,303 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -33 predicate places. [2024-11-22 21:32:35,304 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 197 flow [2024-11-22 21:32:35,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:35,304 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:35,304 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-11-22 21:32:35,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-22 21:32:35,504 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-11-22 21:32:35,504 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:32:35,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:35,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2041026889, now seen corresponding path program 4 times [2024-11-22 21:32:35,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:35,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790136887] [2024-11-22 21:32:35,505 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 21:32:35,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:35,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:35,506 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-11-22 21:32:35,507 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-11-22 21:32:35,691 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 21:32:35,692 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:32:35,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-22 21:32:35,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:32:35,810 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-11-22 21:32:35,866 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 23 treesize of output 3 [2024-11-22 21:32:35,950 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 145 treesize of output 118 [2024-11-22 21:32:36,289 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 115 treesize of output 88 [2024-11-22 21:32:36,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 99 treesize of output 87 [2024-11-22 21:32:36,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 87 treesize of output 83 [2024-11-22 21:32:36,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 83 treesize of output 79 [2024-11-22 21:32:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:36,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:32:36,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:32:36,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790136887] [2024-11-22 21:32:36,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790136887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:36,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:36,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:32:36,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430532070] [2024-11-22 21:32:36,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:36,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:32:36,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:32:36,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:32:36,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:32:36,452 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 96 [2024-11-22 21:32:36,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 197 flow. Second operand has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:36,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:36,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 96 [2024-11-22 21:32:36,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:37,668 INFO L124 PetriNetUnfolderBase]: 4526/7595 cut-off events. [2024-11-22 21:32:37,668 INFO L125 PetriNetUnfolderBase]: For 1028/1043 co-relation queries the response was YES. [2024-11-22 21:32:37,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17248 conditions, 7595 events. 4526/7595 cut-off events. For 1028/1043 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 57243 event pairs, 1844 based on Foata normal form. 26/6830 useless extension candidates. Maximal degree in co-relation 17233. Up to 3485 conditions per place. [2024-11-22 21:32:37,703 INFO L140 encePairwiseOnDemand]: 87/96 looper letters, 36 selfloop transitions, 9 changer transitions 12/87 dead transitions. [2024-11-22 21:32:37,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 87 transitions, 399 flow [2024-11-22 21:32:37,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:32:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:32:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 209 transitions. [2024-11-22 21:32:37,705 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.31101190476190477 [2024-11-22 21:32:37,705 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 197 flow. Second operand 7 states and 209 transitions. [2024-11-22 21:32:37,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 87 transitions, 399 flow [2024-11-22 21:32:37,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 87 transitions, 383 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-22 21:32:37,707 INFO L231 Difference]: Finished difference. Result has 74 places, 61 transitions, 249 flow [2024-11-22 21:32:37,708 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=74, PETRI_TRANSITIONS=61} [2024-11-22 21:32:37,708 INFO L277 CegarLoopForPetriNet]: 103 programPoint places, -29 predicate places. [2024-11-22 21:32:37,708 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 61 transitions, 249 flow [2024-11-22 21:32:37,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:37,709 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:37,709 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-11-22 21:32:37,714 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-11-22 21:32:37,909 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-11-22 21:32:37,909 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2024-11-22 21:32:37,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:37,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1723356473, now seen corresponding path program 5 times [2024-11-22 21:32:37,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:37,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088694463] [2024-11-22 21:32:37,910 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 21:32:37,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:37,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:37,911 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-11-22 21:32:37,912 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-11-22 21:32:38,057 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:32:38,057 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 21:32:38,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:32:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:32:38,200 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-22 21:32:38,200 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:32:38,201 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (79 of 80 remaining) [2024-11-22 21:32:38,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 80 remaining) [2024-11-22 21:32:38,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 80 remaining) [2024-11-22 21:32:38,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 80 remaining) [2024-11-22 21:32:38,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 80 remaining) [2024-11-22 21:32:38,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 80 remaining) [2024-11-22 21:32:38,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 80 remaining) [2024-11-22 21:32:38,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 80 remaining) [2024-11-22 21:32:38,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 80 remaining) [2024-11-22 21:32:38,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 80 remaining) [2024-11-22 21:32:38,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 80 remaining) [2024-11-22 21:32:38,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 80 remaining) [2024-11-22 21:32:38,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 80 remaining) [2024-11-22 21:32:38,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 80 remaining) [2024-11-22 21:32:38,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 80 remaining) [2024-11-22 21:32:38,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 80 remaining) [2024-11-22 21:32:38,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 80 remaining) [2024-11-22 21:32:38,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 80 remaining) [2024-11-22 21:32:38,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 80 remaining) [2024-11-22 21:32:38,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 80 remaining) [2024-11-22 21:32:38,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 80 remaining) [2024-11-22 21:32:38,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 80 remaining) [2024-11-22 21:32:38,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 80 remaining) [2024-11-22 21:32:38,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 80 remaining) [2024-11-22 21:32:38,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 80 remaining) [2024-11-22 21:32:38,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 80 remaining) [2024-11-22 21:32:38,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 80 remaining) [2024-11-22 21:32:38,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 80 remaining) [2024-11-22 21:32:38,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 80 remaining) [2024-11-22 21:32:38,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 80 remaining) [2024-11-22 21:32:38,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 80 remaining) [2024-11-22 21:32:38,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 80 remaining) [2024-11-22 21:32:38,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 80 remaining) [2024-11-22 21:32:38,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 80 remaining) [2024-11-22 21:32:38,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 80 remaining) [2024-11-22 21:32:38,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 80 remaining) [2024-11-22 21:32:38,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 80 remaining) [2024-11-22 21:32:38,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 80 remaining) [2024-11-22 21:32:38,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 80 remaining) [2024-11-22 21:32:38,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 80 remaining) [2024-11-22 21:32:38,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 80 remaining) [2024-11-22 21:32:38,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 80 remaining) [2024-11-22 21:32:38,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 80 remaining) [2024-11-22 21:32:38,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 80 remaining) [2024-11-22 21:32:38,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 80 remaining) [2024-11-22 21:32:38,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 80 remaining) [2024-11-22 21:32:38,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 80 remaining) [2024-11-22 21:32:38,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (32 of 80 remaining) [2024-11-22 21:32:38,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 80 remaining) [2024-11-22 21:32:38,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 80 remaining) [2024-11-22 21:32:38,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 80 remaining) [2024-11-22 21:32:38,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 80 remaining) [2024-11-22 21:32:38,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 80 remaining) [2024-11-22 21:32:38,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 80 remaining) [2024-11-22 21:32:38,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 80 remaining) [2024-11-22 21:32:38,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 80 remaining) [2024-11-22 21:32:38,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 80 remaining) [2024-11-22 21:32:38,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 80 remaining) [2024-11-22 21:32:38,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 80 remaining) [2024-11-22 21:32:38,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 80 remaining) [2024-11-22 21:32:38,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 80 remaining) [2024-11-22 21:32:38,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 80 remaining) [2024-11-22 21:32:38,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 80 remaining) [2024-11-22 21:32:38,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 80 remaining) [2024-11-22 21:32:38,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 80 remaining) [2024-11-22 21:32:38,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 80 remaining) [2024-11-22 21:32:38,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 80 remaining) [2024-11-22 21:32:38,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 80 remaining) [2024-11-22 21:32:38,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 80 remaining) [2024-11-22 21:32:38,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 80 remaining) [2024-11-22 21:32:38,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 80 remaining) [2024-11-22 21:32:38,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 80 remaining) [2024-11-22 21:32:38,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 80 remaining) [2024-11-22 21:32:38,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 80 remaining) [2024-11-22 21:32:38,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 80 remaining) [2024-11-22 21:32:38,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 80 remaining) [2024-11-22 21:32:38,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 80 remaining) [2024-11-22 21:32:38,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 80 remaining) [2024-11-22 21:32:38,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 80 remaining) [2024-11-22 21:32:38,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 80 remaining) [2024-11-22 21:32:38,219 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 (14)] Forceful destruction successful, exit code 0 [2024-11-22 21:32:38,412 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-11-22 21:32:38,413 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:32:38,505 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 21:32:38,505 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 21:32:38,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:32:38 BasicIcfg [2024-11-22 21:32:38,510 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 21:32:38,511 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 21:32:38,511 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 21:32:38,511 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 21:32:38,511 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:32:17" (3/4) ... [2024-11-22 21:32:38,513 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 21:32:38,514 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 21:32:38,514 INFO L158 Benchmark]: Toolchain (without parser) took 23193.95ms. Allocated memory was 79.7MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 41.1MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2024-11-22 21:32:38,514 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 79.7MB. Free memory is still 59.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:32:38,515 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.88ms. Allocated memory is still 79.7MB. Free memory was 40.9MB in the beginning and 35.6MB in the end (delta: 5.3MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2024-11-22 21:32:38,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.87ms. Allocated memory was 79.7MB in the beginning and 134.2MB in the end (delta: 54.5MB). Free memory was 35.6MB in the beginning and 109.8MB in the end (delta: -74.2MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2024-11-22 21:32:38,515 INFO L158 Benchmark]: Boogie Preprocessor took 98.58ms. Allocated memory is still 134.2MB. Free memory was 109.8MB in the beginning and 105.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 21:32:38,516 INFO L158 Benchmark]: RCFGBuilder took 1310.19ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 105.0MB in the beginning and 97.8MB in the end (delta: 7.2MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2024-11-22 21:32:38,517 INFO L158 Benchmark]: TraceAbstraction took 21235.14ms. Allocated memory was 161.5MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 96.8MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2024-11-22 21:32:38,517 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 4.1GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:32:38,518 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.12ms. Allocated memory is still 79.7MB. Free memory is still 59.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 477.88ms. Allocated memory is still 79.7MB. Free memory was 40.9MB in the beginning and 35.6MB in the end (delta: 5.3MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.87ms. Allocated memory was 79.7MB in the beginning and 134.2MB in the end (delta: 54.5MB). Free memory was 35.6MB in the beginning and 109.8MB in the end (delta: -74.2MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.58ms. Allocated memory is still 134.2MB. Free memory was 109.8MB in the beginning and 105.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1310.19ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 105.0MB in the beginning and 97.8MB in the end (delta: 7.2MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * TraceAbstraction took 21235.14ms. Allocated memory was 161.5MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 96.8MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 4.1GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 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; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L741] 0 int y = 0; [L742] 0 _Bool y$flush_delayed; [L743] 0 int y$mem_tmp; [L744] 0 _Bool y$r_buff0_thd0; [L745] 0 _Bool y$r_buff0_thd1; [L746] 0 _Bool y$r_buff0_thd2; [L747] 0 _Bool y$r_buff0_thd3; [L748] 0 _Bool y$r_buff0_thd4; [L749] 0 _Bool y$r_buff1_thd0; [L750] 0 _Bool y$r_buff1_thd1; [L751] 0 _Bool y$r_buff1_thd2; [L752] 0 _Bool y$r_buff1_thd3; [L753] 0 _Bool y$r_buff1_thd4; [L754] 0 _Bool y$read_delayed; [L755] 0 int *y$read_delayed_var; [L756] 0 int y$w_buff0; [L757] 0 _Bool y$w_buff0_used; [L758] 0 int y$w_buff1; [L759] 0 _Bool y$w_buff1_used; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2225; [L855] FCALL, FORK 0 pthread_create(&t2225, ((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, main$tmp_guard0=0, main$tmp_guard1=0, t2225=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}] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 y$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(y) [L769] 1 y$mem_tmp = y [L770] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L771] 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)))) [L771] EXPR 1 \read(y) [L771] 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)))) [L771] 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)))) [L772] 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)))) [L773] 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)))) [L774] 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)))) [L775] 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)))) [L776] 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)))) [L777] 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)))) [L778] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L779] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L780] EXPR 1 \read(y) [L780] 1 __unbuffered_p0_EAX = y [L781] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L781] EXPR 1 \read(y) [L781] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L781] 1 y = y$flush_delayed ? y$mem_tmp : y [L782] 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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=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}] [L856] 0 pthread_t t2226; [L857] FCALL, FORK 0 pthread_create(&t2226, ((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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2225=0, t2226=1, 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}] [L858] 0 pthread_t t2227; [L859] FCALL, FORK 0 pthread_create(&t2227, ((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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2225=0, t2226=1, t2227=2, 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}] [L785] 1 __unbuffered_p0_EBX = 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=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=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}] [L797] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_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, 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}] [L809] 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, 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}] [L812] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_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, 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}] [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 \read(y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \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, 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}] [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_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, 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}] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_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, 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}] [L860] 0 pthread_t t2228; [L861] FCALL, FORK 0 pthread_create(&t2228, ((void *)0), P3, ((void *)0)) 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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2225=0, t2226=1, t2227=2, t2228=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}] [L829] 4 y = 2 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, 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] 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) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 \read(y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] 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) [L832] 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) [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] 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 [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] 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=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, 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 __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, 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}] [L822] 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, 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}] [L863] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2225=0, t2226=1, t2227=2, t2228=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}] [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] 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) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 \read(y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] 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) [L867] 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) [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] 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 [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2225=0, t2226=1, t2227=2, t2228=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}] [L874] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 0 y$flush_delayed = weak$$choice2 [L877] EXPR 0 \read(y) [L877] 0 y$mem_tmp = y [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] EXPR 0 \read(y) [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L879] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L880] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L881] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L882] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L884] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L887] EXPR 0 \read(y) [L887] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] EXPR 0 \read(y) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] 0 y = y$flush_delayed ? y$mem_tmp : y [L889] 0 y$flush_delayed = (_Bool)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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2225=0, t2226=1, t2227=2, t2228=3, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, 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}] [L891] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=2, 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", "safe019_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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=2, 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: -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: 852]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 861]: 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: 857]: 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: 859]: 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.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 14.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 657 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 639 mSDsluCounter, 98 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1693 IncrementalHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 8 mSDtfsCounter, 1693 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=6, InterpolantAutomatonStates: 60, 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.6s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 326 NumberOfCodeBlocks, 326 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 2294 SizeOfPredicates, 29 NumberOfNonLiveVariables, 2161 ConjunctsInSsa, 91 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-11-22 21:32:38,540 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