./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:34:24,171 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:34:24,230 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:34:24,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:34:24,236 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:34:24,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:34:24,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:34:24,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:34:24,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:34:24,263 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:34:24,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:34:24,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:34:24,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:34:24,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:34:24,264 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:34:24,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:34:24,265 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:34:24,265 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:34:24,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:34:24,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:34:24,268 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:34:24,269 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:34:24,269 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:34:24,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:34:24,269 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:34:24,269 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:34:24,269 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:34:24,270 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:34:24,270 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:34:24,270 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:34:24,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:34:24,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:34:24,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:34:24,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:34:24,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:34:24,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:34:24,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:34:24,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:34:24,271 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:34:24,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:34:24,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:34:24,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:34:24,273 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 -> 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 [2024-10-14 19:34:24,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:34:24,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:34:24,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:34:24,561 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:34:24,561 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:34:24,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2024-10-14 19:34:25,908 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:34:26,101 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:34:26,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2024-10-14 19:34:26,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2405f0480/2f07af915a8b4fc1b1162054cf076d93/FLAG950787994 [2024-10-14 19:34:26,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2405f0480/2f07af915a8b4fc1b1162054cf076d93 [2024-10-14 19:34:26,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:34:26,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:34:26,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:34:26,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:34:26,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:34:26,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:34:26" (1/1) ... [2024-10-14 19:34:26,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dc5b03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:26, skipping insertion in model container [2024-10-14 19:34:26,143 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:34:26" (1/1) ... [2024-10-14 19:34:26,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:34:26,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:34:26,508 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:34:26,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:34:26,574 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:34:26,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:26 WrapperNode [2024-10-14 19:34:26,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:34:26,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:34:26,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:34:26,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:34:26,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:26" (1/1) ... [2024-10-14 19:34:26,596 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:26" (1/1) ... [2024-10-14 19:34:26,615 INFO L138 Inliner]: procedures = 175, calls = 62, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 173 [2024-10-14 19:34:26,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:34:26,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:34:26,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:34:26,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:34:26,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:26" (1/1) ... [2024-10-14 19:34:26,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:26" (1/1) ... [2024-10-14 19:34:26,628 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:26" (1/1) ... [2024-10-14 19:34:26,648 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 6 writes are split as follows [0, 6]. [2024-10-14 19:34:26,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:26" (1/1) ... [2024-10-14 19:34:26,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:26" (1/1) ... [2024-10-14 19:34:26,657 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:26" (1/1) ... [2024-10-14 19:34:26,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:26" (1/1) ... [2024-10-14 19:34:26,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:26" (1/1) ... [2024-10-14 19:34:26,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:26" (1/1) ... [2024-10-14 19:34:26,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:34:26,665 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:34:26,666 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:34:26,666 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:34:26,666 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:26" (1/1) ... [2024-10-14 19:34:26,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:34:26,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:34:26,695 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 19:34:26,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 19:34:26,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 19:34:26,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 19:34:26,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 19:34:26,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 19:34:26,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 19:34:26,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:34:26,750 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-14 19:34:26,750 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-14 19:34:26,750 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-14 19:34:26,750 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-14 19:34:26,750 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-14 19:34:26,752 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-14 19:34:26,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 19:34:26,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 19:34:26,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 19:34:26,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:34:26,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:34:26,754 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 19:34:26,872 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:34:26,873 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:34:27,261 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 19:34:27,262 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:34:27,718 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:34:27,718 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 19:34:27,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:34:27 BoogieIcfgContainer [2024-10-14 19:34:27,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:34:27,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:34:27,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:34:27,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:34:27,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:34:26" (1/3) ... [2024-10-14 19:34:27,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fa92af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:34:27, skipping insertion in model container [2024-10-14 19:34:27,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:26" (2/3) ... [2024-10-14 19:34:27,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fa92af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:34:27, skipping insertion in model container [2024-10-14 19:34:27,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:34:27" (3/3) ... [2024-10-14 19:34:27,726 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.opt.i [2024-10-14 19:34:27,743 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:34:27,743 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-10-14 19:34:27,743 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 19:34:27,906 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-14 19:34:27,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 78 transitions, 168 flow [2024-10-14 19:34:27,988 INFO L124 PetriNetUnfolderBase]: 2/75 cut-off events. [2024-10-14 19:34:27,989 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:34:27,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 75 events. 2/75 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 293 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2024-10-14 19:34:27,996 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 78 transitions, 168 flow [2024-10-14 19:34:28,000 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 75 transitions, 159 flow [2024-10-14 19:34:28,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:34:28,016 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;@44da5059, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:34:28,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2024-10-14 19:34:28,021 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 19:34:28,021 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-10-14 19:34:28,021 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:34:28,021 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:34:28,022 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 19:34:28,023 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:34:28,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:34:28,032 INFO L85 PathProgramCache]: Analyzing trace with hash 839398171, now seen corresponding path program 1 times [2024-10-14 19:34:28,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:34:28,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993372630] [2024-10-14 19:34:28,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:34:28,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:34:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:34:28,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:34:28,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:34:28,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993372630] [2024-10-14 19:34:28,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993372630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:34:28,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:34:28,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:34:28,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644899206] [2024-10-14 19:34:28,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:34:28,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:34:28,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:34:28,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:34:28,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:34:28,526 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 78 [2024-10-14 19:34:28,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:34:28,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:34:28,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 78 [2024-10-14 19:34:28,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:34:34,229 INFO L124 PetriNetUnfolderBase]: 21849/31893 cut-off events. [2024-10-14 19:34:34,230 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-10-14 19:34:34,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62502 conditions, 31893 events. 21849/31893 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 3500. Compared 278273 event pairs, 1794 based on Foata normal form. 1120/15404 useless extension candidates. Maximal degree in co-relation 62491. Up to 27560 conditions per place. [2024-10-14 19:34:34,440 INFO L140 encePairwiseOnDemand]: 59/78 looper letters, 73 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-10-14 19:34:34,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 90 transitions, 345 flow [2024-10-14 19:34:34,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:34:34,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:34:34,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2024-10-14 19:34:34,460 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2024-10-14 19:34:34,465 INFO L175 Difference]: Start difference. First operand has 83 places, 75 transitions, 159 flow. Second operand 3 states and 162 transitions. [2024-10-14 19:34:34,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 90 transitions, 345 flow [2024-10-14 19:34:34,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 90 transitions, 340 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 19:34:34,484 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 124 flow [2024-10-14 19:34:34,486 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-10-14 19:34:34,494 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -17 predicate places. [2024-10-14 19:34:34,494 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 124 flow [2024-10-14 19:34:34,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:34:34,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:34:34,498 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 19:34:34,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 19:34:34,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:34:34,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:34:34,500 INFO L85 PathProgramCache]: Analyzing trace with hash 250602757, now seen corresponding path program 1 times [2024-10-14 19:34:34,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:34:34,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529460449] [2024-10-14 19:34:34,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:34:34,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:34:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:34:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:34:34,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:34:34,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529460449] [2024-10-14 19:34:34,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529460449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:34:34,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:34:34,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:34:34,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509621036] [2024-10-14 19:34:34,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:34:34,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:34:34,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:34:34,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:34:34,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:34:34,720 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 78 [2024-10-14 19:34:34,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:34:34,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:34:34,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 78 [2024-10-14 19:34:34,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:34:36,819 INFO L124 PetriNetUnfolderBase]: 6742/10734 cut-off events. [2024-10-14 19:34:36,820 INFO L125 PetriNetUnfolderBase]: For 471/471 co-relation queries the response was YES. [2024-10-14 19:34:36,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20876 conditions, 10734 events. 6742/10734 cut-off events. For 471/471 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 85478 event pairs, 6742 based on Foata normal form. 0/6507 useless extension candidates. Maximal degree in co-relation 20866. Up to 9569 conditions per place. [2024-10-14 19:34:36,921 INFO L140 encePairwiseOnDemand]: 68/78 looper letters, 32 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2024-10-14 19:34:36,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 172 flow [2024-10-14 19:34:36,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:34:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:34:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-10-14 19:34:36,928 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2024-10-14 19:34:36,928 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 124 flow. Second operand 3 states and 96 transitions. [2024-10-14 19:34:36,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 172 flow [2024-10-14 19:34:36,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 48 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:34:36,930 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 104 flow [2024-10-14 19:34:36,930 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2024-10-14 19:34:36,930 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -26 predicate places. [2024-10-14 19:34:36,931 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 104 flow [2024-10-14 19:34:36,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:34:36,931 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:34:36,931 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 19:34:36,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 19:34:36,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:34:36,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:34:36,937 INFO L85 PathProgramCache]: Analyzing trace with hash 250602758, now seen corresponding path program 1 times [2024-10-14 19:34:36,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:34:36,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422883082] [2024-10-14 19:34:36,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:34:36,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:34:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:34:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:34:37,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:34:37,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422883082] [2024-10-14 19:34:37,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422883082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:34:37,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:34:37,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:34:37,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36472121] [2024-10-14 19:34:37,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:34:37,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:34:37,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:34:37,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:34:37,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:34:37,084 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 78 [2024-10-14 19:34:37,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:34:37,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:34:37,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 78 [2024-10-14 19:34:37,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:34:37,587 INFO L124 PetriNetUnfolderBase]: 1151/2022 cut-off events. [2024-10-14 19:34:37,588 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:34:37,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3788 conditions, 2022 events. 1151/2022 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13373 event pairs, 1151 based on Foata normal form. 0/1872 useless extension candidates. Maximal degree in co-relation 3782. Up to 1720 conditions per place. [2024-10-14 19:34:37,609 INFO L140 encePairwiseOnDemand]: 68/78 looper letters, 22 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-10-14 19:34:37,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 134 flow [2024-10-14 19:34:37,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:34:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:34:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-10-14 19:34:37,614 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3717948717948718 [2024-10-14 19:34:37,614 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 104 flow. Second operand 3 states and 87 transitions. [2024-10-14 19:34:37,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 134 flow [2024-10-14 19:34:37,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 133 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:34:37,615 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2024-10-14 19:34:37,615 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-10-14 19:34:37,616 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -34 predicate places. [2024-10-14 19:34:37,616 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2024-10-14 19:34:37,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:34:37,616 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:34:37,616 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:34:37,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 19:34:37,617 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:34:37,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:34:37,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1412301609, now seen corresponding path program 1 times [2024-10-14 19:34:37,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:34:37,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507234083] [2024-10-14 19:34:37,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:34:37,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:34:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:34:37,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:34:37,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:34:37,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507234083] [2024-10-14 19:34:37,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507234083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:34:37,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:34:37,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:34:37,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566255690] [2024-10-14 19:34:37,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:34:37,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:34:37,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:34:37,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:34:37,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:34:37,760 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 78 [2024-10-14 19:34:37,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:34:37,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:34:37,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 78 [2024-10-14 19:34:37,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:34:38,252 INFO L124 PetriNetUnfolderBase]: 989/1773 cut-off events. [2024-10-14 19:34:38,253 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:34:38,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3306 conditions, 1773 events. 989/1773 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11565 event pairs, 185 based on Foata normal form. 0/1683 useless extension candidates. Maximal degree in co-relation 3299. Up to 1237 conditions per place. [2024-10-14 19:34:38,273 INFO L140 encePairwiseOnDemand]: 74/78 looper letters, 35 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-10-14 19:34:38,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 189 flow [2024-10-14 19:34:38,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:34:38,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:34:38,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-10-14 19:34:38,275 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3974358974358974 [2024-10-14 19:34:38,275 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 3 states and 93 transitions. [2024-10-14 19:34:38,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 189 flow [2024-10-14 19:34:38,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:34:38,278 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2024-10-14 19:34:38,278 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-10-14 19:34:38,279 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -33 predicate places. [2024-10-14 19:34:38,281 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2024-10-14 19:34:38,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:34:38,282 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:34:38,282 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:34:38,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 19:34:38,283 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:34:38,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:34:38,283 INFO L85 PathProgramCache]: Analyzing trace with hash -912569264, now seen corresponding path program 1 times [2024-10-14 19:34:38,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:34:38,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29720622] [2024-10-14 19:34:38,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:34:38,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:34:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:34:38,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:34:38,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:34:38,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29720622] [2024-10-14 19:34:38,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29720622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:34:38,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:34:38,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:34:38,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40771197] [2024-10-14 19:34:38,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:34:38,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:34:38,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:34:38,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:34:38,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:34:38,420 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 78 [2024-10-14 19:34:38,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 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-10-14 19:34:38,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:34:38,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 78 [2024-10-14 19:34:38,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:34:38,733 INFO L124 PetriNetUnfolderBase]: 914/1662 cut-off events. [2024-10-14 19:34:38,734 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-10-14 19:34:38,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3330 conditions, 1662 events. 914/1662 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10761 event pairs, 161 based on Foata normal form. 0/1644 useless extension candidates. Maximal degree in co-relation 3321. Up to 1125 conditions per place. [2024-10-14 19:34:38,741 INFO L140 encePairwiseOnDemand]: 75/78 looper letters, 34 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-10-14 19:34:38,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 192 flow [2024-10-14 19:34:38,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:34:38,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:34:38,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-10-14 19:34:38,742 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.34935897435897434 [2024-10-14 19:34:38,742 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 109 transitions. [2024-10-14 19:34:38,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 192 flow [2024-10-14 19:34:38,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 51 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:34:38,744 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2024-10-14 19:34:38,744 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2024-10-14 19:34:38,744 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -33 predicate places. [2024-10-14 19:34:38,745 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2024-10-14 19:34:38,745 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-10-14 19:34:38,745 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:34:38,745 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:34:38,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 19:34:38,745 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:34:38,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:34:38,746 INFO L85 PathProgramCache]: Analyzing trace with hash -12128729, now seen corresponding path program 1 times [2024-10-14 19:34:38,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:34:38,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635923572] [2024-10-14 19:34:38,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:34:38,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:34:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:34:38,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:34:38,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:34:38,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635923572] [2024-10-14 19:34:38,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635923572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:34:38,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:34:38,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:34:38,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860994784] [2024-10-14 19:34:38,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:34:38,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:34:38,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:34:38,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:34:38,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:34:38,958 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 78 [2024-10-14 19:34:38,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 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-10-14 19:34:38,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:34:38,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 78 [2024-10-14 19:34:38,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:34:39,220 INFO L124 PetriNetUnfolderBase]: 839/1551 cut-off events. [2024-10-14 19:34:39,220 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-10-14 19:34:39,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3072 conditions, 1551 events. 839/1551 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9973 event pairs, 137 based on Foata normal form. 36/1569 useless extension candidates. Maximal degree in co-relation 3063. Up to 1014 conditions per place. [2024-10-14 19:34:39,227 INFO L140 encePairwiseOnDemand]: 75/78 looper letters, 33 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-10-14 19:34:39,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 186 flow [2024-10-14 19:34:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:34:39,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:34:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-10-14 19:34:39,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.34615384615384615 [2024-10-14 19:34:39,229 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 108 transitions. [2024-10-14 19:34:39,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 186 flow [2024-10-14 19:34:39,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 181 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 19:34:39,230 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2024-10-14 19:34:39,230 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2024-10-14 19:34:39,231 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -34 predicate places. [2024-10-14 19:34:39,231 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2024-10-14 19:34:39,231 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-10-14 19:34:39,232 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:34:39,232 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:34:39,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 19:34:39,232 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:34:39,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:34:39,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1206103162, now seen corresponding path program 1 times [2024-10-14 19:34:39,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:34:39,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001479133] [2024-10-14 19:34:39,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:34:39,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:34:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:34:39,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:34:39,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:34:39,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001479133] [2024-10-14 19:34:39,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001479133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:34:39,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:34:39,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:34:39,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794609234] [2024-10-14 19:34:39,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:34:39,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:34:39,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:34:39,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:34:39,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:34:39,299 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 78 [2024-10-14 19:34:39,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:34:39,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:34:39,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 78 [2024-10-14 19:34:39,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:34:39,720 INFO L124 PetriNetUnfolderBase]: 839/1518 cut-off events. [2024-10-14 19:34:39,723 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-10-14 19:34:39,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3038 conditions, 1518 events. 839/1518 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9688 event pairs, 839 based on Foata normal form. 48/1512 useless extension candidates. Maximal degree in co-relation 3030. Up to 1264 conditions per place. [2024-10-14 19:34:39,734 INFO L140 encePairwiseOnDemand]: 76/78 looper letters, 19 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-10-14 19:34:39,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 125 flow [2024-10-14 19:34:39,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:34:39,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:34:39,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-10-14 19:34:39,742 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.31196581196581197 [2024-10-14 19:34:39,742 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 73 transitions. [2024-10-14 19:34:39,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 125 flow [2024-10-14 19:34:39,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:34:39,743 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2024-10-14 19:34:39,743 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2024-10-14 19:34:39,744 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -35 predicate places. [2024-10-14 19:34:39,744 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2024-10-14 19:34:39,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:34:39,744 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:34:39,744 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:34:39,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 19:34:39,744 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:34:39,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:34:39,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1206105066, now seen corresponding path program 1 times [2024-10-14 19:34:39,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:34:39,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834589631] [2024-10-14 19:34:39,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:34:39,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:34:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:34:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:34:39,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:34:39,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834589631] [2024-10-14 19:34:39,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834589631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:34:39,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:34:39,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:34:39,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362358387] [2024-10-14 19:34:39,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:34:39,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:34:39,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:34:39,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:34:39,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:34:39,881 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 78 [2024-10-14 19:34:39,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-10-14 19:34:39,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:34:39,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 78 [2024-10-14 19:34:39,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:34:40,310 INFO L124 PetriNetUnfolderBase]: 1698/2821 cut-off events. [2024-10-14 19:34:40,311 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:34:40,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5748 conditions, 2821 events. 1698/2821 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 16970 event pairs, 198 based on Foata normal form. 100/2878 useless extension candidates. Maximal degree in co-relation 5740. Up to 1579 conditions per place. [2024-10-14 19:34:40,320 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 43 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2024-10-14 19:34:40,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 236 flow [2024-10-14 19:34:40,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:34:40,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:34:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2024-10-14 19:34:40,326 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.34294871794871795 [2024-10-14 19:34:40,326 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 4 states and 107 transitions. [2024-10-14 19:34:40,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 236 flow [2024-10-14 19:34:40,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:34:40,330 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 113 flow [2024-10-14 19:34:40,330 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2024-10-14 19:34:40,331 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -32 predicate places. [2024-10-14 19:34:40,331 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 113 flow [2024-10-14 19:34:40,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-10-14 19:34:40,331 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:34:40,331 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:34:40,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 19:34:40,331 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:34:40,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:34:40,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1567743620, now seen corresponding path program 1 times [2024-10-14 19:34:40,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:34:40,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619782909] [2024-10-14 19:34:40,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:34:40,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:34:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:34:40,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:34:40,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:34:40,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619782909] [2024-10-14 19:34:40,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619782909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:34:40,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:34:40,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:34:40,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566684766] [2024-10-14 19:34:40,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:34:40,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:34:40,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:34:40,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:34:40,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:34:40,605 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 78 [2024-10-14 19:34:40,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:34:40,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:34:40,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 78 [2024-10-14 19:34:40,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:34:41,048 INFO L124 PetriNetUnfolderBase]: 1056/1783 cut-off events. [2024-10-14 19:34:41,049 INFO L125 PetriNetUnfolderBase]: For 411/411 co-relation queries the response was YES. [2024-10-14 19:34:41,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4237 conditions, 1783 events. 1056/1783 cut-off events. For 411/411 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 9460 event pairs, 110 based on Foata normal form. 82/1832 useless extension candidates. Maximal degree in co-relation 4226. Up to 697 conditions per place. [2024-10-14 19:34:41,057 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 54 selfloop transitions, 8 changer transitions 1/73 dead transitions. [2024-10-14 19:34:41,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 73 transitions, 338 flow [2024-10-14 19:34:41,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:34:41,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:34:41,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-10-14 19:34:41,059 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.34615384615384615 [2024-10-14 19:34:41,059 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 113 flow. Second operand 5 states and 135 transitions. [2024-10-14 19:34:41,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 73 transitions, 338 flow [2024-10-14 19:34:41,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 328 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-14 19:34:41,062 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 153 flow [2024-10-14 19:34:41,062 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2024-10-14 19:34:41,062 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -28 predicate places. [2024-10-14 19:34:41,063 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 153 flow [2024-10-14 19:34:41,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:34:41,063 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:34:41,063 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:34:41,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 19:34:41,063 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:34:41,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:34:41,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1968878848, now seen corresponding path program 1 times [2024-10-14 19:34:41,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:34:41,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551109342] [2024-10-14 19:34:41,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:34:41,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:34:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:34:41,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:34:41,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:34:41,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551109342] [2024-10-14 19:34:41,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551109342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:34:41,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:34:41,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:34:41,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796717143] [2024-10-14 19:34:41,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:34:41,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:34:41,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:34:41,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:34:41,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:34:41,545 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 78 [2024-10-14 19:34:41,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:34:41,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:34:41,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 78 [2024-10-14 19:34:41,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:34:41,860 INFO L124 PetriNetUnfolderBase]: 599/996 cut-off events. [2024-10-14 19:34:41,860 INFO L125 PetriNetUnfolderBase]: For 750/750 co-relation queries the response was YES. [2024-10-14 19:34:41,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2685 conditions, 996 events. 599/996 cut-off events. For 750/750 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4433 event pairs, 93 based on Foata normal form. 40/1003 useless extension candidates. Maximal degree in co-relation 2672. Up to 308 conditions per place. [2024-10-14 19:34:41,865 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 47 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2024-10-14 19:34:41,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 343 flow [2024-10-14 19:34:41,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:34:41,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:34:41,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-10-14 19:34:41,866 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.30982905982905984 [2024-10-14 19:34:41,866 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 153 flow. Second operand 6 states and 145 transitions. [2024-10-14 19:34:41,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 343 flow [2024-10-14 19:34:41,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 318 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-14 19:34:41,870 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 167 flow [2024-10-14 19:34:41,870 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2024-10-14 19:34:41,871 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -25 predicate places. [2024-10-14 19:34:41,871 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 167 flow [2024-10-14 19:34:41,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:34:41,871 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:34:41,871 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:34:41,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 19:34:41,872 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:34:41,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:34:41,872 INFO L85 PathProgramCache]: Analyzing trace with hash -176980430, now seen corresponding path program 1 times [2024-10-14 19:34:41,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:34:41,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581168205] [2024-10-14 19:34:41,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:34:41,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:34:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:34:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:34:42,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:34:42,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581168205] [2024-10-14 19:34:42,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581168205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:34:42,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:34:42,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:34:42,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143558255] [2024-10-14 19:34:42,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:34:42,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:34:42,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:34:42,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:34:42,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:34:42,340 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 78 [2024-10-14 19:34:42,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:34:42,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:34:42,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 78 [2024-10-14 19:34:42,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:34:42,749 INFO L124 PetriNetUnfolderBase]: 995/1760 cut-off events. [2024-10-14 19:34:42,749 INFO L125 PetriNetUnfolderBase]: For 759/779 co-relation queries the response was YES. [2024-10-14 19:34:42,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4275 conditions, 1760 events. 995/1760 cut-off events. For 759/779 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9516 event pairs, 219 based on Foata normal form. 8/1719 useless extension candidates. Maximal degree in co-relation 4261. Up to 680 conditions per place. [2024-10-14 19:34:42,757 INFO L140 encePairwiseOnDemand]: 71/78 looper letters, 35 selfloop transitions, 4 changer transitions 17/73 dead transitions. [2024-10-14 19:34:42,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 73 transitions, 361 flow [2024-10-14 19:34:42,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:34:42,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:34:42,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-10-14 19:34:42,759 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3141025641025641 [2024-10-14 19:34:42,759 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 167 flow. Second operand 6 states and 147 transitions. [2024-10-14 19:34:42,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 73 transitions, 361 flow [2024-10-14 19:34:42,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 297 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-10-14 19:34:42,765 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 139 flow [2024-10-14 19:34:42,765 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2024-10-14 19:34:42,766 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -24 predicate places. [2024-10-14 19:34:42,766 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 139 flow [2024-10-14 19:34:42,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:34:42,766 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:34:42,767 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:34:42,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 19:34:42,767 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:34:42,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:34:42,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1861443000, now seen corresponding path program 2 times [2024-10-14 19:34:42,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:34:42,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562598969] [2024-10-14 19:34:42,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:34:42,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:34:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:34:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:34:44,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:34:44,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562598969] [2024-10-14 19:34:44,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562598969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:34:44,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:34:44,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 19:34:44,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685473741] [2024-10-14 19:34:44,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:34:44,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 19:34:44,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:34:44,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 19:34:44,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 19:34:44,122 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 78 [2024-10-14 19:34:44,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 139 flow. Second operand has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:34:44,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:34:44,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 78 [2024-10-14 19:34:44,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:34:44,688 INFO L124 PetriNetUnfolderBase]: 1037/1896 cut-off events. [2024-10-14 19:34:44,689 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2024-10-14 19:34:44,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4086 conditions, 1896 events. 1037/1896 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10805 event pairs, 75 based on Foata normal form. 16/1869 useless extension candidates. Maximal degree in co-relation 4072. Up to 485 conditions per place. [2024-10-14 19:34:44,696 INFO L140 encePairwiseOnDemand]: 66/78 looper letters, 41 selfloop transitions, 10 changer transitions 43/111 dead transitions. [2024-10-14 19:34:44,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 111 transitions, 503 flow [2024-10-14 19:34:44,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 19:34:44,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-14 19:34:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 261 transitions. [2024-10-14 19:34:44,697 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3041958041958042 [2024-10-14 19:34:44,697 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 139 flow. Second operand 11 states and 261 transitions. [2024-10-14 19:34:44,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 111 transitions, 503 flow [2024-10-14 19:34:44,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 111 transitions, 484 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-10-14 19:34:44,700 INFO L231 Difference]: Finished difference. Result has 71 places, 47 transitions, 194 flow [2024-10-14 19:34:44,700 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=194, PETRI_PLACES=71, PETRI_TRANSITIONS=47} [2024-10-14 19:34:44,701 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -12 predicate places. [2024-10-14 19:34:44,701 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 47 transitions, 194 flow [2024-10-14 19:34:44,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:34:44,701 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:34:44,701 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:34:44,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 19:34:44,701 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:34:44,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:34:44,702 INFO L85 PathProgramCache]: Analyzing trace with hash -803684086, now seen corresponding path program 3 times [2024-10-14 19:34:44,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:34:44,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879358446] [2024-10-14 19:34:44,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:34:44,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:34:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:34:45,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:34:45,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:34:45,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879358446] [2024-10-14 19:34:45,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879358446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:34:45,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:34:45,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:34:45,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842080573] [2024-10-14 19:34:45,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:34:45,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:34:45,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:34:45,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:34:45,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:34:45,044 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 78 [2024-10-14 19:34:45,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 47 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:34:45,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:34:45,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 78 [2024-10-14 19:34:45,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:34:45,274 INFO L124 PetriNetUnfolderBase]: 638/1183 cut-off events. [2024-10-14 19:34:45,274 INFO L125 PetriNetUnfolderBase]: For 487/491 co-relation queries the response was YES. [2024-10-14 19:34:45,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2992 conditions, 1183 events. 638/1183 cut-off events. For 487/491 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5986 event pairs, 173 based on Foata normal form. 10/1156 useless extension candidates. Maximal degree in co-relation 2972. Up to 405 conditions per place. [2024-10-14 19:34:45,280 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 26 selfloop transitions, 2 changer transitions 35/80 dead transitions. [2024-10-14 19:34:45,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 80 transitions, 419 flow [2024-10-14 19:34:45,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 19:34:45,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-14 19:34:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2024-10-14 19:34:45,281 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2967032967032967 [2024-10-14 19:34:45,281 INFO L175 Difference]: Start difference. First operand has 71 places, 47 transitions, 194 flow. Second operand 7 states and 162 transitions. [2024-10-14 19:34:45,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 80 transitions, 419 flow [2024-10-14 19:34:45,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 80 transitions, 377 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-10-14 19:34:45,284 INFO L231 Difference]: Finished difference. Result has 68 places, 40 transitions, 143 flow [2024-10-14 19:34:45,285 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=143, PETRI_PLACES=68, PETRI_TRANSITIONS=40} [2024-10-14 19:34:45,285 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -15 predicate places. [2024-10-14 19:34:45,286 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 40 transitions, 143 flow [2024-10-14 19:34:45,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:34:45,286 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:34:45,286 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:34:45,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 19:34:45,286 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:34:45,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:34:45,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2086614572, now seen corresponding path program 4 times [2024-10-14 19:34:45,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:34:45,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175181542] [2024-10-14 19:34:45,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:34:45,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:34:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:34:45,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 19:34:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:34:45,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 19:34:45,498 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 19:34:45,499 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (68 of 69 remaining) [2024-10-14 19:34:45,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (67 of 69 remaining) [2024-10-14 19:34:45,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 69 remaining) [2024-10-14 19:34:45,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 69 remaining) [2024-10-14 19:34:45,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 69 remaining) [2024-10-14 19:34:45,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 69 remaining) [2024-10-14 19:34:45,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 69 remaining) [2024-10-14 19:34:45,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 69 remaining) [2024-10-14 19:34:45,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 69 remaining) [2024-10-14 19:34:45,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 69 remaining) [2024-10-14 19:34:45,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 69 remaining) [2024-10-14 19:34:45,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 69 remaining) [2024-10-14 19:34:45,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 69 remaining) [2024-10-14 19:34:45,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 69 remaining) [2024-10-14 19:34:45,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 69 remaining) [2024-10-14 19:34:45,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 69 remaining) [2024-10-14 19:34:45,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 69 remaining) [2024-10-14 19:34:45,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 69 remaining) [2024-10-14 19:34:45,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 69 remaining) [2024-10-14 19:34:45,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 69 remaining) [2024-10-14 19:34:45,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 69 remaining) [2024-10-14 19:34:45,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 69 remaining) [2024-10-14 19:34:45,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 69 remaining) [2024-10-14 19:34:45,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 69 remaining) [2024-10-14 19:34:45,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 69 remaining) [2024-10-14 19:34:45,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 69 remaining) [2024-10-14 19:34:45,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 69 remaining) [2024-10-14 19:34:45,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 69 remaining) [2024-10-14 19:34:45,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 69 remaining) [2024-10-14 19:34:45,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 69 remaining) [2024-10-14 19:34:45,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 69 remaining) [2024-10-14 19:34:45,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 69 remaining) [2024-10-14 19:34:45,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 69 remaining) [2024-10-14 19:34:45,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 69 remaining) [2024-10-14 19:34:45,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 69 remaining) [2024-10-14 19:34:45,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 69 remaining) [2024-10-14 19:34:45,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (32 of 69 remaining) [2024-10-14 19:34:45,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 69 remaining) [2024-10-14 19:34:45,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 69 remaining) [2024-10-14 19:34:45,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 69 remaining) [2024-10-14 19:34:45,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 69 remaining) [2024-10-14 19:34:45,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 69 remaining) [2024-10-14 19:34:45,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 69 remaining) [2024-10-14 19:34:45,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 69 remaining) [2024-10-14 19:34:45,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 69 remaining) [2024-10-14 19:34:45,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 69 remaining) [2024-10-14 19:34:45,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 69 remaining) [2024-10-14 19:34:45,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 69 remaining) [2024-10-14 19:34:45,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 69 remaining) [2024-10-14 19:34:45,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 69 remaining) [2024-10-14 19:34:45,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 69 remaining) [2024-10-14 19:34:45,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 69 remaining) [2024-10-14 19:34:45,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 69 remaining) [2024-10-14 19:34:45,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 69 remaining) [2024-10-14 19:34:45,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 69 remaining) [2024-10-14 19:34:45,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 69 remaining) [2024-10-14 19:34:45,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 69 remaining) [2024-10-14 19:34:45,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 69 remaining) [2024-10-14 19:34:45,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 69 remaining) [2024-10-14 19:34:45,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 69 remaining) [2024-10-14 19:34:45,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 69 remaining) [2024-10-14 19:34:45,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 69 remaining) [2024-10-14 19:34:45,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 69 remaining) [2024-10-14 19:34:45,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 69 remaining) [2024-10-14 19:34:45,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 69 remaining) [2024-10-14 19:34:45,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 69 remaining) [2024-10-14 19:34:45,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 69 remaining) [2024-10-14 19:34:45,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 69 remaining) [2024-10-14 19:34:45,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 69 remaining) [2024-10-14 19:34:45,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 19:34:45,513 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:34:45,614 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 19:34:45,615 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 19:34:45,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:34:45 BasicIcfg [2024-10-14 19:34:45,620 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 19:34:45,621 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 19:34:45,621 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 19:34:45,621 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 19:34:45,621 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:34:27" (3/4) ... [2024-10-14 19:34:45,623 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 19:34:45,624 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 19:34:45,624 INFO L158 Benchmark]: Toolchain (without parser) took 19487.94ms. Allocated memory was 184.5MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 114.3MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 332.1MB. Max. memory is 16.1GB. [2024-10-14 19:34:45,625 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 184.5MB. Free memory was 144.0MB in the beginning and 143.8MB in the end (delta: 174.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:34:45,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.21ms. Allocated memory is still 184.5MB. Free memory was 114.2MB in the beginning and 143.2MB in the end (delta: -28.9MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-10-14 19:34:45,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.69ms. Allocated memory is still 184.5MB. Free memory was 143.2MB in the beginning and 140.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 19:34:45,625 INFO L158 Benchmark]: Boogie Preprocessor took 49.37ms. Allocated memory is still 184.5MB. Free memory was 140.9MB in the beginning and 135.7MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 19:34:45,626 INFO L158 Benchmark]: RCFGBuilder took 1053.42ms. Allocated memory is still 184.5MB. Free memory was 135.7MB in the beginning and 69.6MB in the end (delta: 66.1MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2024-10-14 19:34:45,626 INFO L158 Benchmark]: TraceAbstraction took 17899.41ms. Allocated memory was 184.5MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 68.6MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 283.3MB. Max. memory is 16.1GB. [2024-10-14 19:34:45,626 INFO L158 Benchmark]: Witness Printer took 3.59ms. Allocated memory is still 4.2GB. Free memory is still 3.8GB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:34:45,627 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 184.5MB. Free memory was 144.0MB in the beginning and 143.8MB in the end (delta: 174.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.21ms. Allocated memory is still 184.5MB. Free memory was 114.2MB in the beginning and 143.2MB in the end (delta: -28.9MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.69ms. Allocated memory is still 184.5MB. Free memory was 143.2MB in the beginning and 140.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.37ms. Allocated memory is still 184.5MB. Free memory was 140.9MB in the beginning and 135.7MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1053.42ms. Allocated memory is still 184.5MB. Free memory was 135.7MB in the beginning and 69.6MB in the end (delta: 66.1MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. * TraceAbstraction took 17899.41ms. Allocated memory was 184.5MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 68.6MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 283.3MB. Max. memory is 16.1GB. * Witness Printer took 3.59ms. Allocated memory is still 4.2GB. Free memory is still 3.8GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L731] 0 int __unbuffered_p2_EAX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1780; [L854] FCALL, FORK 0 pthread_create(&t1780, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1780=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t1781; [L856] FCALL, FORK 0 pthread_create(&t1781, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1780=0, t1781=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L857] 0 pthread_t t1782; [L858] FCALL, FORK 0 pthread_create(&t1782, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1780=0, t1781=1, t1782=2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L808] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L828] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L760] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780=0, t1781=1, t1782=2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780=0, t1781=1, t1782=2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780=0, t1781=1, t1782=2, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L17] 0 __assert_fail ("0", "safe000_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 856]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 130 locations, 69 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: 17.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 503 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 480 mSDsluCounter, 178 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 155 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1200 IncrementalHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 23 mSDtfsCounter, 1200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=12, InterpolantAutomatonStates: 62, 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.7s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 1076 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 19:34:45,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:34:48,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:34:48,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 19:34:48,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:34:48,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:34:48,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:34:48,727 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:34:48,727 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:34:48,728 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:34:48,732 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:34:48,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:34:48,734 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:34:48,734 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:34:48,734 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:34:48,735 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:34:48,735 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:34:48,735 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:34:48,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:34:48,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:34:48,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:34:48,736 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:34:48,742 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:34:48,743 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:34:48,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:34:48,743 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:34:48,743 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 19:34:48,743 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:34:48,743 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 19:34:48,743 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:34:48,744 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:34:48,744 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:34:48,744 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:34:48,744 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:34:48,744 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:34:48,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:34:48,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:34:48,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:34:48,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:34:48,757 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 19:34:48,757 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 19:34:48,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:34:48,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:34:48,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:34:48,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:34:48,761 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 19:34:48,761 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 -> 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 [2024-10-14 19:34:49,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:34:49,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:34:49,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:34:49,378 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:34:49,378 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:34:49,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2024-10-14 19:34:50,806 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:34:51,054 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:34:51,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2024-10-14 19:34:51,083 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5e9e2a1b/6aecd7032ad1425c984d90dabdce2440/FLAG6f547d2af [2024-10-14 19:34:51,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5e9e2a1b/6aecd7032ad1425c984d90dabdce2440 [2024-10-14 19:34:51,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:34:51,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:34:51,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:34:51,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:34:51,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:34:51,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:34:51" (1/1) ... [2024-10-14 19:34:51,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18675522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:51, skipping insertion in model container [2024-10-14 19:34:51,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:34:51" (1/1) ... [2024-10-14 19:34:51,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:34:51,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:34:51,721 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:34:51,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:34:51,827 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:34:51,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:51 WrapperNode [2024-10-14 19:34:51,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:34:51,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:34:51,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:34:51,829 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:34:51,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:51" (1/1) ... [2024-10-14 19:34:51,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:51" (1/1) ... [2024-10-14 19:34:51,891 INFO L138 Inliner]: procedures = 179, calls = 62, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 174 [2024-10-14 19:34:51,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:34:51,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:34:51,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:34:51,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:34:51,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:51" (1/1) ... [2024-10-14 19:34:51,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:51" (1/1) ... [2024-10-14 19:34:51,906 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:51" (1/1) ... [2024-10-14 19:34:51,929 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 6 writes are split as follows [0, 6]. [2024-10-14 19:34:51,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:51" (1/1) ... [2024-10-14 19:34:51,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:51" (1/1) ... [2024-10-14 19:34:51,941 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:51" (1/1) ... [2024-10-14 19:34:51,946 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:51" (1/1) ... [2024-10-14 19:34:51,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:51" (1/1) ... [2024-10-14 19:34:51,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:51" (1/1) ... [2024-10-14 19:34:51,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:34:51,966 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:34:51,966 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:34:51,966 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:34:51,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:51" (1/1) ... [2024-10-14 19:34:51,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:34:51,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:34:52,003 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 19:34:52,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 19:34:52,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 19:34:52,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 19:34:52,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 19:34:52,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:34:52,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 19:34:52,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 19:34:52,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 19:34:52,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 19:34:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-14 19:34:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-14 19:34:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-14 19:34:52,044 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-14 19:34:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-14 19:34:52,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-14 19:34:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-14 19:34:52,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-14 19:34:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 19:34:52,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:34:52,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:34:52,047 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 19:34:52,238 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:34:52,239 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:34:52,706 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 19:34:52,706 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:34:53,166 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:34:53,166 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 19:34:53,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:34:53 BoogieIcfgContainer [2024-10-14 19:34:53,166 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:34:53,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:34:53,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:34:53,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:34:53,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:34:51" (1/3) ... [2024-10-14 19:34:53,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec7dfd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:34:53, skipping insertion in model container [2024-10-14 19:34:53,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:34:51" (2/3) ... [2024-10-14 19:34:53,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec7dfd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:34:53, skipping insertion in model container [2024-10-14 19:34:53,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:34:53" (3/3) ... [2024-10-14 19:34:53,172 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.opt.i [2024-10-14 19:34:53,184 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:34:53,185 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-10-14 19:34:53,185 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 19:34:53,295 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-14 19:34:53,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 78 transitions, 168 flow [2024-10-14 19:34:53,351 INFO L124 PetriNetUnfolderBase]: 2/75 cut-off events. [2024-10-14 19:34:53,351 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:34:53,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 75 events. 2/75 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 293 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2024-10-14 19:34:53,354 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 78 transitions, 168 flow [2024-10-14 19:34:53,357 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 75 transitions, 159 flow [2024-10-14 19:34:53,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:34:53,367 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;@41d97ca5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:34:53,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2024-10-14 19:34:53,371 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 19:34:53,371 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-10-14 19:34:53,371 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:34:53,371 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:34:53,372 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 19:34:53,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:34:53,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:34:53,376 INFO L85 PathProgramCache]: Analyzing trace with hash 841306781, now seen corresponding path program 1 times [2024-10-14 19:34:53,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:34:53,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677733873] [2024-10-14 19:34:53,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:34:53,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:34:53,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:34:53,388 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:34:53,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 19:34:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:34:53,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:34:53,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:34:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:34:53,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:34:53,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:34:53,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677733873] [2024-10-14 19:34:53,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677733873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:34:53,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:34:53,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:34:53,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538612462] [2024-10-14 19:34:53,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:34:53,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:34:53,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:34:53,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:34:53,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:34:53,573 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 78 [2024-10-14 19:34:53,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:34:53,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:34:53,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 78 [2024-10-14 19:34:53,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:34:59,384 INFO L124 PetriNetUnfolderBase]: 21849/32043 cut-off events. [2024-10-14 19:34:59,384 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-10-14 19:34:59,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62652 conditions, 32043 events. 21849/32043 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 3494. Compared 250234 event pairs, 7194 based on Foata normal form. 1120/15454 useless extension candidates. Maximal degree in co-relation 62641. Up to 27560 conditions per place. [2024-10-14 19:34:59,591 INFO L140 encePairwiseOnDemand]: 59/78 looper letters, 73 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-10-14 19:34:59,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 90 transitions, 345 flow [2024-10-14 19:34:59,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:34:59,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:34:59,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2024-10-14 19:34:59,601 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2024-10-14 19:34:59,603 INFO L175 Difference]: Start difference. First operand has 83 places, 75 transitions, 159 flow. Second operand 3 states and 162 transitions. [2024-10-14 19:34:59,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 90 transitions, 345 flow [2024-10-14 19:34:59,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 90 transitions, 340 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 19:34:59,612 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 124 flow [2024-10-14 19:34:59,614 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-10-14 19:34:59,618 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -17 predicate places. [2024-10-14 19:34:59,618 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 124 flow [2024-10-14 19:34:59,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:34:59,619 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:34:59,619 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 19:34:59,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 19:34:59,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:34:59,822 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:34:59,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:34:59,824 INFO L85 PathProgramCache]: Analyzing trace with hash 309769669, now seen corresponding path program 1 times [2024-10-14 19:34:59,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:34:59,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926192700] [2024-10-14 19:34:59,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:34:59,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:34:59,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:34:59,830 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:34:59,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 19:35:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:00,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:35:00,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:35:00,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:35:00,124 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:35:00,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:35:00,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926192700] [2024-10-14 19:35:00,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926192700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:00,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:00,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:35:00,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638315146] [2024-10-14 19:35:00,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:00,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:35:00,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:35:00,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:35:00,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:35:00,133 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 78 [2024-10-14 19:35:00,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:00,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:00,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 78 [2024-10-14 19:35:00,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:02,370 INFO L124 PetriNetUnfolderBase]: 6742/10734 cut-off events. [2024-10-14 19:35:02,371 INFO L125 PetriNetUnfolderBase]: For 471/471 co-relation queries the response was YES. [2024-10-14 19:35:02,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20876 conditions, 10734 events. 6742/10734 cut-off events. For 471/471 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 85413 event pairs, 6742 based on Foata normal form. 0/6507 useless extension candidates. Maximal degree in co-relation 20866. Up to 9569 conditions per place. [2024-10-14 19:35:02,552 INFO L140 encePairwiseOnDemand]: 68/78 looper letters, 32 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2024-10-14 19:35:02,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 172 flow [2024-10-14 19:35:02,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:35:02,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:35:02,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-10-14 19:35:02,769 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2024-10-14 19:35:02,769 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 124 flow. Second operand 3 states and 96 transitions. [2024-10-14 19:35:02,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 172 flow [2024-10-14 19:35:02,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 48 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:35:02,771 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 104 flow [2024-10-14 19:35:02,771 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2024-10-14 19:35:02,779 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -26 predicate places. [2024-10-14 19:35:02,779 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 104 flow [2024-10-14 19:35:02,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:02,779 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:02,779 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 19:35:02,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-14 19:35:02,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:02,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:35:02,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:02,981 INFO L85 PathProgramCache]: Analyzing trace with hash 309769670, now seen corresponding path program 1 times [2024-10-14 19:35:02,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:35:02,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096686079] [2024-10-14 19:35:02,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:02,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:02,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:35:02,987 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:35:02,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 19:35:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:03,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:35:03,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:35:03,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:35:03,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:35:03,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:35:03,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096686079] [2024-10-14 19:35:03,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096686079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:03,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:03,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:35:03,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586978061] [2024-10-14 19:35:03,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:03,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:35:03,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:35:03,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:35:03,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:35:03,243 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 78 [2024-10-14 19:35:03,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:03,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:03,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 78 [2024-10-14 19:35:03,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:03,569 INFO L124 PetriNetUnfolderBase]: 1151/2022 cut-off events. [2024-10-14 19:35:03,569 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:35:03,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3788 conditions, 2022 events. 1151/2022 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13373 event pairs, 1151 based on Foata normal form. 0/1872 useless extension candidates. Maximal degree in co-relation 3782. Up to 1720 conditions per place. [2024-10-14 19:35:03,577 INFO L140 encePairwiseOnDemand]: 68/78 looper letters, 22 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-10-14 19:35:03,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 134 flow [2024-10-14 19:35:03,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:35:03,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:35:03,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-10-14 19:35:03,582 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3717948717948718 [2024-10-14 19:35:03,582 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 104 flow. Second operand 3 states and 87 transitions. [2024-10-14 19:35:03,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 134 flow [2024-10-14 19:35:03,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 133 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:35:03,583 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2024-10-14 19:35:03,583 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-10-14 19:35:03,584 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -34 predicate places. [2024-10-14 19:35:03,584 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2024-10-14 19:35:03,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:03,584 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:03,584 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:35:03,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 19:35:03,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:03,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:35:03,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:03,786 INFO L85 PathProgramCache]: Analyzing trace with hash 600621977, now seen corresponding path program 1 times [2024-10-14 19:35:03,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:35:03,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335221237] [2024-10-14 19:35:03,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:03,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:03,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:35:03,788 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:35:03,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 19:35:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:03,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:35:03,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:35:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:35:03,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:35:03,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:35:03,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335221237] [2024-10-14 19:35:03,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1335221237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:03,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:03,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:35:03,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690319056] [2024-10-14 19:35:03,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:03,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:35:03,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:35:03,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:35:03,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:35:03,953 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 78 [2024-10-14 19:35:03,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:03,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:03,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 78 [2024-10-14 19:35:03,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:04,655 INFO L124 PetriNetUnfolderBase]: 2241/3692 cut-off events. [2024-10-14 19:35:04,655 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:35:04,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7099 conditions, 3692 events. 2241/3692 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 23164 event pairs, 198 based on Foata normal form. 100/3585 useless extension candidates. Maximal degree in co-relation 7092. Up to 2368 conditions per place. [2024-10-14 19:35:04,673 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 46 selfloop transitions, 5 changer transitions 1/63 dead transitions. [2024-10-14 19:35:04,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 63 transitions, 243 flow [2024-10-14 19:35:04,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:35:04,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:35:04,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2024-10-14 19:35:04,675 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3525641025641026 [2024-10-14 19:35:04,675 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 4 states and 110 transitions. [2024-10-14 19:35:04,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 63 transitions, 243 flow [2024-10-14 19:35:04,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 63 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:35:04,677 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 118 flow [2024-10-14 19:35:04,677 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-10-14 19:35:04,678 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -31 predicate places. [2024-10-14 19:35:04,678 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 118 flow [2024-10-14 19:35:04,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:04,678 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:04,678 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:35:04,687 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-10-14 19:35:04,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:04,880 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:35:04,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:04,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1728330127, now seen corresponding path program 1 times [2024-10-14 19:35:04,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:35:04,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469501430] [2024-10-14 19:35:04,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:04,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:04,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:35:04,886 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:35:04,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 19:35:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:05,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:35:05,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:35:05,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:35:05,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:35:05,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:35:05,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469501430] [2024-10-14 19:35:05,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469501430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:05,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:05,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:35:05,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198545372] [2024-10-14 19:35:05,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:05,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:35:05,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:35:05,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:35:05,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:35:05,090 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 78 [2024-10-14 19:35:05,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:05,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:05,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 78 [2024-10-14 19:35:05,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:05,495 INFO L124 PetriNetUnfolderBase]: 1284/2171 cut-off events. [2024-10-14 19:35:05,495 INFO L125 PetriNetUnfolderBase]: For 447/447 co-relation queries the response was YES. [2024-10-14 19:35:05,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4832 conditions, 2171 events. 1284/2171 cut-off events. For 447/447 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 12016 event pairs, 110 based on Foata normal form. 82/2140 useless extension candidates. Maximal degree in co-relation 4822. Up to 1045 conditions per place. [2024-10-14 19:35:05,504 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 57 selfloop transitions, 8 changer transitions 1/77 dead transitions. [2024-10-14 19:35:05,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 77 transitions, 343 flow [2024-10-14 19:35:05,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:35:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:35:05,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-10-14 19:35:05,506 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.35384615384615387 [2024-10-14 19:35:05,506 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 118 flow. Second operand 5 states and 138 transitions. [2024-10-14 19:35:05,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 77 transitions, 343 flow [2024-10-14 19:35:05,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 77 transitions, 333 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-14 19:35:05,508 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 158 flow [2024-10-14 19:35:05,509 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-10-14 19:35:05,512 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -27 predicate places. [2024-10-14 19:35:05,513 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 158 flow [2024-10-14 19:35:05,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:05,513 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:05,513 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:35:05,520 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-10-14 19:35:05,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:05,716 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:35:05,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:05,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2060642704, now seen corresponding path program 1 times [2024-10-14 19:35:05,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:35:05,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970679364] [2024-10-14 19:35:05,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:05,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:05,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:35:05,724 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:35:05,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 19:35:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:05,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:35:05,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:35:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:35:05,967 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:35:05,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:35:05,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970679364] [2024-10-14 19:35:05,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970679364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:05,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:05,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:35:05,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590482370] [2024-10-14 19:35:05,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:05,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:35:05,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:35:05,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:35:05,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:35:05,977 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 78 [2024-10-14 19:35:05,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 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-10-14 19:35:05,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:05,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 78 [2024-10-14 19:35:05,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:06,458 INFO L124 PetriNetUnfolderBase]: 635/1064 cut-off events. [2024-10-14 19:35:06,458 INFO L125 PetriNetUnfolderBase]: For 750/750 co-relation queries the response was YES. [2024-10-14 19:35:06,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2704 conditions, 1064 events. 635/1064 cut-off events. For 750/750 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4743 event pairs, 93 based on Foata normal form. 40/1055 useless extension candidates. Maximal degree in co-relation 2692. Up to 308 conditions per place. [2024-10-14 19:35:06,478 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 50 selfloop transitions, 11 changer transitions 1/73 dead transitions. [2024-10-14 19:35:06,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 350 flow [2024-10-14 19:35:06,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:35:06,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:35:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-10-14 19:35:06,482 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3162393162393162 [2024-10-14 19:35:06,482 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 158 flow. Second operand 6 states and 148 transitions. [2024-10-14 19:35:06,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 350 flow [2024-10-14 19:35:06,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 325 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-14 19:35:06,490 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 172 flow [2024-10-14 19:35:06,490 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2024-10-14 19:35:06,491 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -24 predicate places. [2024-10-14 19:35:06,496 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 172 flow [2024-10-14 19:35:06,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 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-10-14 19:35:06,497 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:06,497 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:35:06,512 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 (7)] Forceful destruction successful, exit code 0 [2024-10-14 19:35:06,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:06,698 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:35:06,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:06,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1878216288, now seen corresponding path program 1 times [2024-10-14 19:35:06,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:35:06,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332717066] [2024-10-14 19:35:06,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:06,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:06,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:35:06,707 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:35:06,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 19:35:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:06,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:35:06,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:35:07,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:35:07,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:35:07,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:35:07,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332717066] [2024-10-14 19:35:07,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332717066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:07,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:07,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:35:07,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947580754] [2024-10-14 19:35:07,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:07,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:35:07,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:35:07,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:35:07,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:35:07,289 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 78 [2024-10-14 19:35:07,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:07,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:07,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 78 [2024-10-14 19:35:07,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:07,462 INFO L124 PetriNetUnfolderBase]: 352/698 cut-off events. [2024-10-14 19:35:07,463 INFO L125 PetriNetUnfolderBase]: For 285/295 co-relation queries the response was YES. [2024-10-14 19:35:07,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1583 conditions, 698 events. 352/698 cut-off events. For 285/295 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3386 event pairs, 70 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 1570. Up to 460 conditions per place. [2024-10-14 19:35:07,465 INFO L140 encePairwiseOnDemand]: 75/78 looper letters, 28 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-10-14 19:35:07,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 248 flow [2024-10-14 19:35:07,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:35:07,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:35:07,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-10-14 19:35:07,472 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3301282051282051 [2024-10-14 19:35:07,472 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 172 flow. Second operand 4 states and 103 transitions. [2024-10-14 19:35:07,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 248 flow [2024-10-14 19:35:07,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 192 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-10-14 19:35:07,474 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 118 flow [2024-10-14 19:35:07,474 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2024-10-14 19:35:07,475 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -30 predicate places. [2024-10-14 19:35:07,475 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 118 flow [2024-10-14 19:35:07,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:07,481 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:07,481 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:35:07,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-14 19:35:07,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:07,682 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:35:07,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:07,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1073713825, now seen corresponding path program 1 times [2024-10-14 19:35:07,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:35:07,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401066504] [2024-10-14 19:35:07,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:07,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:07,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:35:07,687 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:35:07,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 19:35:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:07,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:35:07,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:35:08,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:35:08,151 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:35:08,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:35:08,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401066504] [2024-10-14 19:35:08,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401066504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:08,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:08,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:35:08,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7328430] [2024-10-14 19:35:08,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:08,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:35:08,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:35:08,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:35:08,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:35:08,161 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 78 [2024-10-14 19:35:08,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:08,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:08,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 78 [2024-10-14 19:35:08,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:08,371 INFO L124 PetriNetUnfolderBase]: 340/678 cut-off events. [2024-10-14 19:35:08,372 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-14 19:35:08,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1361 conditions, 678 events. 340/678 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3291 event pairs, 66 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 1352. Up to 440 conditions per place. [2024-10-14 19:35:08,377 INFO L140 encePairwiseOnDemand]: 75/78 looper letters, 27 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-10-14 19:35:08,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 50 transitions, 192 flow [2024-10-14 19:35:08,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:35:08,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:35:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-10-14 19:35:08,378 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3269230769230769 [2024-10-14 19:35:08,378 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 118 flow. Second operand 4 states and 102 transitions. [2024-10-14 19:35:08,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 50 transitions, 192 flow [2024-10-14 19:35:08,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:35:08,380 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 117 flow [2024-10-14 19:35:08,380 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2024-10-14 19:35:08,382 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -30 predicate places. [2024-10-14 19:35:08,385 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 117 flow [2024-10-14 19:35:08,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:08,386 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:08,386 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:35:08,393 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-10-14 19:35:08,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:08,589 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:35:08,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:08,590 INFO L85 PathProgramCache]: Analyzing trace with hash -958953086, now seen corresponding path program 1 times [2024-10-14 19:35:08,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:35:08,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051108257] [2024-10-14 19:35:08,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:08,595 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:08,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:35:08,598 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:35:08,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 19:35:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:08,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:35:08,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:35:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:35:08,892 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:35:08,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:35:08,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051108257] [2024-10-14 19:35:08,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051108257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:08,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:08,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:35:08,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289430010] [2024-10-14 19:35:08,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:08,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:35:08,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:35:08,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:35:08,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:35:08,897 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 78 [2024-10-14 19:35:08,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 117 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-10-14 19:35:08,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:08,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 78 [2024-10-14 19:35:08,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:09,037 INFO L124 PetriNetUnfolderBase]: 339/644 cut-off events. [2024-10-14 19:35:09,038 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-14 19:35:09,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 644 events. 339/644 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3115 event pairs, 315 based on Foata normal form. 8/580 useless extension candidates. Maximal degree in co-relation 1338. Up to 529 conditions per place. [2024-10-14 19:35:09,040 INFO L140 encePairwiseOnDemand]: 76/78 looper letters, 19 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-10-14 19:35:09,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 41 transitions, 157 flow [2024-10-14 19:35:09,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:35:09,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:35:09,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-10-14 19:35:09,045 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.31196581196581197 [2024-10-14 19:35:09,045 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 117 flow. Second operand 3 states and 73 transitions. [2024-10-14 19:35:09,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 41 transitions, 157 flow [2024-10-14 19:35:09,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 41 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:35:09,046 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 112 flow [2024-10-14 19:35:09,046 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2024-10-14 19:35:09,046 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -31 predicate places. [2024-10-14 19:35:09,046 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 112 flow [2024-10-14 19:35:09,046 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-10-14 19:35:09,047 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:09,047 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:35:09,053 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-10-14 19:35:09,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:09,253 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:35:09,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:09,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1871580686, now seen corresponding path program 1 times [2024-10-14 19:35:09,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:35:09,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512630006] [2024-10-14 19:35:09,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:09,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:09,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:35:09,263 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:35:09,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 19:35:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:09,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:35:09,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:35:09,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:35:09,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:35:09,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:35:09,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512630006] [2024-10-14 19:35:09,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512630006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:09,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:09,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:35:09,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199951441] [2024-10-14 19:35:09,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:09,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:35:09,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:35:09,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:35:09,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:35:09,567 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 78 [2024-10-14 19:35:09,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 112 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:09,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:09,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 78 [2024-10-14 19:35:09,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:09,853 INFO L124 PetriNetUnfolderBase]: 995/1760 cut-off events. [2024-10-14 19:35:09,853 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:35:09,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3720 conditions, 1760 events. 995/1760 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9557 event pairs, 219 based on Foata normal form. 8/1719 useless extension candidates. Maximal degree in co-relation 3711. Up to 680 conditions per place. [2024-10-14 19:35:09,859 INFO L140 encePairwiseOnDemand]: 71/78 looper letters, 35 selfloop transitions, 4 changer transitions 17/73 dead transitions. [2024-10-14 19:35:09,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 298 flow [2024-10-14 19:35:09,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:35:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:35:09,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-10-14 19:35:09,860 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3141025641025641 [2024-10-14 19:35:09,860 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 112 flow. Second operand 6 states and 147 transitions. [2024-10-14 19:35:09,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 298 flow [2024-10-14 19:35:09,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 297 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:35:09,862 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 139 flow [2024-10-14 19:35:09,862 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2024-10-14 19:35:09,863 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -24 predicate places. [2024-10-14 19:35:09,863 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 139 flow [2024-10-14 19:35:09,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:09,863 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:09,863 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:35:09,874 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 (11)] Forceful destruction successful, exit code 0 [2024-10-14 19:35:10,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:10,068 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:35:10,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:10,069 INFO L85 PathProgramCache]: Analyzing trace with hash 805075508, now seen corresponding path program 2 times [2024-10-14 19:35:10,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:35:10,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051714493] [2024-10-14 19:35:10,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 19:35:10,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:10,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:35:10,081 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:35:10,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-14 19:35:10,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 19:35:10,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:35:10,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:35:10,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:35:10,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:35:10,337 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:35:10,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:35:10,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051714493] [2024-10-14 19:35:10,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051714493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:10,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:10,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:35:10,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629242110] [2024-10-14 19:35:10,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:10,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:35:10,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:35:10,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:35:10,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:35:10,352 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 78 [2024-10-14 19:35:10,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 139 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:10,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:10,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 78 [2024-10-14 19:35:10,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:10,692 INFO L124 PetriNetUnfolderBase]: 728/1341 cut-off events. [2024-10-14 19:35:10,693 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-10-14 19:35:10,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2896 conditions, 1341 events. 728/1341 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7183 event pairs, 231 based on Foata normal form. 8/1306 useless extension candidates. Maximal degree in co-relation 2882. Up to 614 conditions per place. [2024-10-14 19:35:10,697 INFO L140 encePairwiseOnDemand]: 71/78 looper letters, 29 selfloop transitions, 3 changer transitions 17/66 dead transitions. [2024-10-14 19:35:10,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 66 transitions, 295 flow [2024-10-14 19:35:10,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:35:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:35:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2024-10-14 19:35:10,698 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.29914529914529914 [2024-10-14 19:35:10,698 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 139 flow. Second operand 6 states and 140 transitions. [2024-10-14 19:35:10,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 66 transitions, 295 flow [2024-10-14 19:35:10,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 66 transitions, 280 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-14 19:35:10,700 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 133 flow [2024-10-14 19:35:10,700 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=133, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2024-10-14 19:35:10,700 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -22 predicate places. [2024-10-14 19:35:10,700 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 133 flow [2024-10-14 19:35:10,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:10,701 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:10,701 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:35:10,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-14 19:35:10,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:10,902 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:35:10,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:10,903 INFO L85 PathProgramCache]: Analyzing trace with hash -963289432, now seen corresponding path program 3 times [2024-10-14 19:35:10,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:35:10,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736220269] [2024-10-14 19:35:10,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 19:35:10,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:10,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:35:10,911 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:35:10,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-14 19:35:11,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-14 19:35:11,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:35:11,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:35:11,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:35:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:35:11,115 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:35:11,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:35:11,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736220269] [2024-10-14 19:35:11,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736220269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:11,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:11,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:35:11,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049536408] [2024-10-14 19:35:11,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:11,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:35:11,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:35:11,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:35:11,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:35:11,130 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 78 [2024-10-14 19:35:11,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:11,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:11,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 78 [2024-10-14 19:35:11,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:11,438 INFO L124 PetriNetUnfolderBase]: 579/1074 cut-off events. [2024-10-14 19:35:11,439 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-10-14 19:35:11,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2253 conditions, 1074 events. 579/1074 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5234 event pairs, 165 based on Foata normal form. 8/1053 useless extension candidates. Maximal degree in co-relation 2238. Up to 405 conditions per place. [2024-10-14 19:35:11,443 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 26 selfloop transitions, 2 changer transitions 28/73 dead transitions. [2024-10-14 19:35:11,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 322 flow [2024-10-14 19:35:11,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 19:35:11,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-14 19:35:11,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2024-10-14 19:35:11,444 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2967032967032967 [2024-10-14 19:35:11,445 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 133 flow. Second operand 7 states and 162 transitions. [2024-10-14 19:35:11,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 322 flow [2024-10-14 19:35:11,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 298 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-10-14 19:35:11,447 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 129 flow [2024-10-14 19:35:11,447 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=129, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2024-10-14 19:35:11,447 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, -21 predicate places. [2024-10-14 19:35:11,448 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 129 flow [2024-10-14 19:35:11,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:11,448 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:11,448 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:35:11,457 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 (13)] Ended with exit code 0 [2024-10-14 19:35:11,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:11,649 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2024-10-14 19:35:11,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:11,649 INFO L85 PathProgramCache]: Analyzing trace with hash 473512478, now seen corresponding path program 4 times [2024-10-14 19:35:11,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:35:11,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928431987] [2024-10-14 19:35:11,650 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 19:35:11,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:11,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:35:11,657 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:35:11,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-14 19:35:11,959 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 19:35:11,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-14 19:35:11,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 19:35:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:35:12,167 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-14 19:35:12,168 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 19:35:12,169 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (68 of 69 remaining) [2024-10-14 19:35:12,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (67 of 69 remaining) [2024-10-14 19:35:12,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 69 remaining) [2024-10-14 19:35:12,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 69 remaining) [2024-10-14 19:35:12,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 69 remaining) [2024-10-14 19:35:12,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 69 remaining) [2024-10-14 19:35:12,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 69 remaining) [2024-10-14 19:35:12,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 69 remaining) [2024-10-14 19:35:12,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 69 remaining) [2024-10-14 19:35:12,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 69 remaining) [2024-10-14 19:35:12,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 69 remaining) [2024-10-14 19:35:12,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 69 remaining) [2024-10-14 19:35:12,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 69 remaining) [2024-10-14 19:35:12,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 69 remaining) [2024-10-14 19:35:12,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 69 remaining) [2024-10-14 19:35:12,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 69 remaining) [2024-10-14 19:35:12,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 69 remaining) [2024-10-14 19:35:12,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 69 remaining) [2024-10-14 19:35:12,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 69 remaining) [2024-10-14 19:35:12,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 69 remaining) [2024-10-14 19:35:12,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 69 remaining) [2024-10-14 19:35:12,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 69 remaining) [2024-10-14 19:35:12,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 69 remaining) [2024-10-14 19:35:12,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 69 remaining) [2024-10-14 19:35:12,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 69 remaining) [2024-10-14 19:35:12,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 69 remaining) [2024-10-14 19:35:12,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 69 remaining) [2024-10-14 19:35:12,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 69 remaining) [2024-10-14 19:35:12,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 69 remaining) [2024-10-14 19:35:12,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 69 remaining) [2024-10-14 19:35:12,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 69 remaining) [2024-10-14 19:35:12,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 69 remaining) [2024-10-14 19:35:12,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 69 remaining) [2024-10-14 19:35:12,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 69 remaining) [2024-10-14 19:35:12,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 69 remaining) [2024-10-14 19:35:12,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 69 remaining) [2024-10-14 19:35:12,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (32 of 69 remaining) [2024-10-14 19:35:12,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 69 remaining) [2024-10-14 19:35:12,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 69 remaining) [2024-10-14 19:35:12,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 69 remaining) [2024-10-14 19:35:12,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 69 remaining) [2024-10-14 19:35:12,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 69 remaining) [2024-10-14 19:35:12,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 69 remaining) [2024-10-14 19:35:12,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 69 remaining) [2024-10-14 19:35:12,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 69 remaining) [2024-10-14 19:35:12,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 69 remaining) [2024-10-14 19:35:12,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 69 remaining) [2024-10-14 19:35:12,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 69 remaining) [2024-10-14 19:35:12,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 69 remaining) [2024-10-14 19:35:12,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 69 remaining) [2024-10-14 19:35:12,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 69 remaining) [2024-10-14 19:35:12,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 69 remaining) [2024-10-14 19:35:12,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 69 remaining) [2024-10-14 19:35:12,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 69 remaining) [2024-10-14 19:35:12,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 69 remaining) [2024-10-14 19:35:12,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 69 remaining) [2024-10-14 19:35:12,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 69 remaining) [2024-10-14 19:35:12,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 69 remaining) [2024-10-14 19:35:12,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 69 remaining) [2024-10-14 19:35:12,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 69 remaining) [2024-10-14 19:35:12,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 69 remaining) [2024-10-14 19:35:12,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 69 remaining) [2024-10-14 19:35:12,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 69 remaining) [2024-10-14 19:35:12,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 69 remaining) [2024-10-14 19:35:12,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 69 remaining) [2024-10-14 19:35:12,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 69 remaining) [2024-10-14 19:35:12,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 69 remaining) [2024-10-14 19:35:12,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 69 remaining) [2024-10-14 19:35:12,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 69 remaining) [2024-10-14 19:35:12,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-14 19:35:12,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:12,386 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:35:12,658 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 19:35:12,658 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 19:35:12,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:35:12 BasicIcfg [2024-10-14 19:35:12,666 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 19:35:12,668 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 19:35:12,668 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 19:35:12,668 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 19:35:12,669 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:34:53" (3/4) ... [2024-10-14 19:35:12,670 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 19:35:12,671 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 19:35:12,675 INFO L158 Benchmark]: Toolchain (without parser) took 21311.49ms. Allocated memory was 67.1MB in the beginning and 6.8GB in the end (delta: 6.8GB). Free memory was 29.1MB in the beginning and 5.7GB in the end (delta: -5.7GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-14 19:35:12,675 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 67.1MB. Free memory was 41.8MB in the beginning and 41.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:35:12,676 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.83ms. Allocated memory was 67.1MB in the beginning and 100.7MB in the end (delta: 33.6MB). Free memory was 48.4MB in the beginning and 72.8MB in the end (delta: -24.4MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2024-10-14 19:35:12,676 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.37ms. Allocated memory is still 100.7MB. Free memory was 72.8MB in the beginning and 70.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 19:35:12,676 INFO L158 Benchmark]: Boogie Preprocessor took 73.30ms. Allocated memory is still 100.7MB. Free memory was 70.0MB in the beginning and 65.4MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 19:35:12,676 INFO L158 Benchmark]: RCFGBuilder took 1200.83ms. Allocated memory was 100.7MB in the beginning and 127.9MB in the end (delta: 27.3MB). Free memory was 65.4MB in the beginning and 92.1MB in the end (delta: -26.7MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2024-10-14 19:35:12,676 INFO L158 Benchmark]: TraceAbstraction took 19498.09ms. Allocated memory was 127.9MB in the beginning and 6.8GB in the end (delta: 6.7GB). Free memory was 92.1MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-14 19:35:12,676 INFO L158 Benchmark]: Witness Printer took 2.53ms. Allocated memory is still 6.8GB. Free memory is still 5.7GB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:35:12,678 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.75ms. Allocated memory is still 67.1MB. Free memory was 41.8MB in the beginning and 41.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.83ms. Allocated memory was 67.1MB in the beginning and 100.7MB in the end (delta: 33.6MB). Free memory was 48.4MB in the beginning and 72.8MB in the end (delta: -24.4MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.37ms. Allocated memory is still 100.7MB. Free memory was 72.8MB in the beginning and 70.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.30ms. Allocated memory is still 100.7MB. Free memory was 70.0MB in the beginning and 65.4MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1200.83ms. Allocated memory was 100.7MB in the beginning and 127.9MB in the end (delta: 27.3MB). Free memory was 65.4MB in the beginning and 92.1MB in the end (delta: -26.7MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * TraceAbstraction took 19498.09ms. Allocated memory was 127.9MB in the beginning and 6.8GB in the end (delta: 6.7GB). Free memory was 92.1MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 2.53ms. Allocated memory is still 6.8GB. Free memory is still 5.7GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L731] 0 int __unbuffered_p2_EAX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1780; [L854] FCALL, FORK 0 pthread_create(&t1780, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1780=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t1781; [L856] FCALL, FORK 0 pthread_create(&t1781, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1780=0, t1781=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L857] 0 pthread_t t1782; [L858] FCALL, FORK 0 pthread_create(&t1782, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1780=0, t1781=1, t1782=2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L808] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L828] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L760] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780=0, t1781=1, t1782=2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780=0, t1781=1, t1782=2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780=0, t1781=1, t1782=2, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L17] 0 __assert_fail ("0", "safe000_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 856]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 130 locations, 69 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: 19.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 442 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 411 mSDsluCounter, 97 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1085 IncrementalHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 10 mSDtfsCounter, 1085 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=6, InterpolantAutomatonStates: 54, 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.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 1143 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1827 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 19:35:12,735 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