./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix039.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix039.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4df22382a468f75ea1bc6624bacd8789c0b9b9f8aa1bc2866cf2715dcbc507bc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:33:45,012 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:33:45,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:33:45,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:33:45,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:33:45,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:33:45,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:33:45,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:33:45,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:33:45,097 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:33:45,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:33:45,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:33:45,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:33:45,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:33:45,098 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:33:45,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:33:45,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:33:45,099 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:33:45,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:33:45,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:33:45,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:33:45,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:33:45,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:33:45,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:33:45,101 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:33:45,101 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:33:45,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:33:45,102 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:33:45,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:33:45,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:33:45,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:33:45,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:33:45,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:33:45,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:33:45,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:33:45,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:33:45,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:33:45,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:33:45,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:33:45,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:33:45,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:33:45,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:33:45,106 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 ! call(reach_error())) ) 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 -> 4df22382a468f75ea1bc6624bacd8789c0b9b9f8aa1bc2866cf2715dcbc507bc [2024-11-19 01:33:45,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:33:45,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:33:45,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:33:45,342 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:33:45,343 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:33:45,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix039.opt.i [2024-11-19 01:33:46,569 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:33:46,802 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:33:46,803 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix039.opt.i [2024-11-19 01:33:46,815 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd59f9633/502e42eaa3be427988e0ec0d0cd6327b/FLAGd7dbcae47 [2024-11-19 01:33:46,832 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd59f9633/502e42eaa3be427988e0ec0d0cd6327b [2024-11-19 01:33:46,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:33:46,835 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:33:46,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:33:46,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:33:46,840 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:33:46,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:33:46" (1/1) ... [2024-11-19 01:33:46,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fb0c37d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:46, skipping insertion in model container [2024-11-19 01:33:46,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:33:46" (1/1) ... [2024-11-19 01:33:46,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:33:47,041 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix039.opt.i[944,957] [2024-11-19 01:33:47,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:33:47,218 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:33:47,229 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix039.opt.i[944,957] [2024-11-19 01:33:47,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:33:47,297 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:33:47,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:47 WrapperNode [2024-11-19 01:33:47,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:33:47,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:33:47,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:33:47,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:33:47,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:47" (1/1) ... [2024-11-19 01:33:47,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:47" (1/1) ... [2024-11-19 01:33:47,355 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2024-11-19 01:33:47,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:33:47,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:33:47,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:33:47,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:33:47,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:47" (1/1) ... [2024-11-19 01:33:47,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:47" (1/1) ... [2024-11-19 01:33:47,370 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:47" (1/1) ... [2024-11-19 01:33:47,393 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 01:33:47,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:47" (1/1) ... [2024-11-19 01:33:47,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:47" (1/1) ... [2024-11-19 01:33:47,403 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:47" (1/1) ... [2024-11-19 01:33:47,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:47" (1/1) ... [2024-11-19 01:33:47,406 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:47" (1/1) ... [2024-11-19 01:33:47,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:47" (1/1) ... [2024-11-19 01:33:47,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:33:47,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:33:47,413 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:33:47,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:33:47,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:47" (1/1) ... [2024-11-19 01:33:47,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:33:47,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:33:47,444 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:33:47,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:33:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 01:33:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:33:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-19 01:33:47,484 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-19 01:33:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-19 01:33:47,484 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-19 01:33:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-19 01:33:47,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-19 01:33:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-19 01:33:47,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-19 01:33:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:33:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 01:33:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:33:47,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:33:47,486 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 01:33:47,596 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:33:47,598 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:33:47,842 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 01:33:47,843 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:33:47,988 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:33:47,989 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 01:33:47,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:33:47 BoogieIcfgContainer [2024-11-19 01:33:47,989 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:33:47,991 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:33:47,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:33:47,995 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:33:47,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:33:46" (1/3) ... [2024-11-19 01:33:47,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da58223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:33:47, skipping insertion in model container [2024-11-19 01:33:47,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:47" (2/3) ... [2024-11-19 01:33:47,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da58223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:33:47, skipping insertion in model container [2024-11-19 01:33:47,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:33:47" (3/3) ... [2024-11-19 01:33:47,997 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.opt.i [2024-11-19 01:33:48,010 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:33:48,011 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 01:33:48,011 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 01:33:48,057 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 01:33:48,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2024-11-19 01:33:48,114 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-11-19 01:33:48,116 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:33:48,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 91 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2024-11-19 01:33:48,120 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2024-11-19 01:33:48,123 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2024-11-19 01:33:48,129 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:33:48,135 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=LoopHeads, 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;@42b1e3ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:33:48,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-19 01:33:48,144 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:33:48,145 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-11-19 01:33:48,145 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:33:48,145 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:33:48,146 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:33:48,146 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 01:33:48,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:33:48,151 INFO L85 PathProgramCache]: Analyzing trace with hash 504891015, now seen corresponding path program 1 times [2024-11-19 01:33:48,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:33:48,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546134805] [2024-11-19 01:33:48,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:33:48,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:33:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:33:48,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:33:48,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:33:48,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546134805] [2024-11-19 01:33:48,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546134805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:33:48,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:33:48,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 01:33:48,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923875301] [2024-11-19 01:33:48,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:33:48,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:33:48,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:33:48,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:33:48,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:33:48,634 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 50 [2024-11-19 01:33:48,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:33:48,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:33:48,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 50 [2024-11-19 01:33:48,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:33:48,933 INFO L124 PetriNetUnfolderBase]: 699/1415 cut-off events. [2024-11-19 01:33:48,933 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:33:48,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2483 conditions, 1415 events. 699/1415 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10423 event pairs, 159 based on Foata normal form. 48/1419 useless extension candidates. Maximal degree in co-relation 2471. Up to 757 conditions per place. [2024-11-19 01:33:48,945 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 25 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-11-19 01:33:48,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 176 flow [2024-11-19 01:33:48,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:33:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:33:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-11-19 01:33:48,955 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7733333333333333 [2024-11-19 01:33:48,956 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 116 transitions. [2024-11-19 01:33:48,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 176 flow [2024-11-19 01:33:48,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 172 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 01:33:48,964 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2024-11-19 01:33:48,965 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-11-19 01:33:48,969 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2024-11-19 01:33:48,969 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2024-11-19 01:33:48,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:33:48,969 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:33:48,969 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:33:48,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 01:33:48,970 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 01:33:48,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:33:48,970 INFO L85 PathProgramCache]: Analyzing trace with hash -923608244, now seen corresponding path program 1 times [2024-11-19 01:33:48,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:33:48,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747938774] [2024-11-19 01:33:48,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:33:48,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:33:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:33:49,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:33:49,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:33:49,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747938774] [2024-11-19 01:33:49,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747938774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:33:49,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:33:49,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:33:49,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759332484] [2024-11-19 01:33:49,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:33:49,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:33:49,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:33:49,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:33:49,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:33:49,162 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2024-11-19 01:33:49,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:33:49,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:33:49,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2024-11-19 01:33:49,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:33:49,706 INFO L124 PetriNetUnfolderBase]: 3362/5410 cut-off events. [2024-11-19 01:33:49,707 INFO L125 PetriNetUnfolderBase]: For 244/244 co-relation queries the response was YES. [2024-11-19 01:33:49,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10451 conditions, 5410 events. 3362/5410 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 37781 event pairs, 536 based on Foata normal form. 180/5400 useless extension candidates. Maximal degree in co-relation 10441. Up to 2677 conditions per place. [2024-11-19 01:33:49,732 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 43 selfloop transitions, 6 changer transitions 1/69 dead transitions. [2024-11-19 01:33:49,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 260 flow [2024-11-19 01:33:49,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:33:49,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:33:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2024-11-19 01:33:49,736 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.72 [2024-11-19 01:33:49,736 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 4 states and 144 transitions. [2024-11-19 01:33:49,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 260 flow [2024-11-19 01:33:49,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 01:33:49,738 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow [2024-11-19 01:33:49,738 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2024-11-19 01:33:49,739 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2024-11-19 01:33:49,740 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow [2024-11-19 01:33:49,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:33:49,741 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:33:49,741 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:33:49,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:33:49,741 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 01:33:49,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:33:49,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1418144272, now seen corresponding path program 1 times [2024-11-19 01:33:49,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:33:49,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356567961] [2024-11-19 01:33:49,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:33:49,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:33:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:33:49,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:33:49,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:33:49,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356567961] [2024-11-19 01:33:49,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356567961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:33:49,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:33:49,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:33:49,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627223201] [2024-11-19 01:33:49,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:33:49,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:33:49,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:33:49,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:33:49,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:33:49,912 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2024-11-19 01:33:49,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:33:49,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:33:49,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2024-11-19 01:33:49,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:33:50,439 INFO L124 PetriNetUnfolderBase]: 2896/4666 cut-off events. [2024-11-19 01:33:50,440 INFO L125 PetriNetUnfolderBase]: For 1279/1279 co-relation queries the response was YES. [2024-11-19 01:33:50,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10665 conditions, 4666 events. 2896/4666 cut-off events. For 1279/1279 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 31535 event pairs, 192 based on Foata normal form. 174/4686 useless extension candidates. Maximal degree in co-relation 10653. Up to 2065 conditions per place. [2024-11-19 01:33:50,474 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 55 selfloop transitions, 10 changer transitions 1/85 dead transitions. [2024-11-19 01:33:50,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 85 transitions, 373 flow [2024-11-19 01:33:50,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:33:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:33:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 183 transitions. [2024-11-19 01:33:50,477 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.732 [2024-11-19 01:33:50,477 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 136 flow. Second operand 5 states and 183 transitions. [2024-11-19 01:33:50,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 85 transitions, 373 flow [2024-11-19 01:33:50,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 85 transitions, 362 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-19 01:33:50,483 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow [2024-11-19 01:33:50,483 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-11-19 01:33:50,484 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2024-11-19 01:33:50,484 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow [2024-11-19 01:33:50,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:33:50,485 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:33:50,485 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:33:50,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:33:50,486 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 01:33:50,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:33:50,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1248416830, now seen corresponding path program 1 times [2024-11-19 01:33:50,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:33:50,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139847774] [2024-11-19 01:33:50,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:33:50,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:33:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:33:50,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:33:50,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:33:50,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139847774] [2024-11-19 01:33:50,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139847774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:33:50,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:33:50,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:33:50,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286791843] [2024-11-19 01:33:50,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:33:50,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:33:50,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:33:50,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:33:50,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:33:50,671 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2024-11-19 01:33:50,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:33:50,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:33:50,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2024-11-19 01:33:50,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:33:50,995 INFO L124 PetriNetUnfolderBase]: 2029/3221 cut-off events. [2024-11-19 01:33:50,996 INFO L125 PetriNetUnfolderBase]: For 2676/2676 co-relation queries the response was YES. [2024-11-19 01:33:51,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8415 conditions, 3221 events. 2029/3221 cut-off events. For 2676/2676 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 19135 event pairs, 69 based on Foata normal form. 140/3275 useless extension candidates. Maximal degree in co-relation 8401. Up to 977 conditions per place. [2024-11-19 01:33:51,012 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 65 selfloop transitions, 14 changer transitions 1/99 dead transitions. [2024-11-19 01:33:51,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 99 transitions, 492 flow [2024-11-19 01:33:51,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:33:51,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 01:33:51,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 220 transitions. [2024-11-19 01:33:51,014 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2024-11-19 01:33:51,014 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 188 flow. Second operand 6 states and 220 transitions. [2024-11-19 01:33:51,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 99 transitions, 492 flow [2024-11-19 01:33:51,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 99 transitions, 462 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-19 01:33:51,019 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow [2024-11-19 01:33:51,020 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-11-19 01:33:51,020 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2024-11-19 01:33:51,020 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow [2024-11-19 01:33:51,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:33:51,021 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:33:51,021 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:33:51,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:33:51,021 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 01:33:51,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:33:51,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1105033708, now seen corresponding path program 1 times [2024-11-19 01:33:51,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:33:51,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022286637] [2024-11-19 01:33:51,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:33:51,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:33:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:33:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:33:51,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:33:51,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022286637] [2024-11-19 01:33:51,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022286637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:33:51,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:33:51,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:33:51,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745345950] [2024-11-19 01:33:51,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:33:51,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:33:51,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:33:51,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:33:51,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:33:51,204 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2024-11-19 01:33:51,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:33:51,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:33:51,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2024-11-19 01:33:51,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:33:51,487 INFO L124 PetriNetUnfolderBase]: 1321/1997 cut-off events. [2024-11-19 01:33:51,487 INFO L125 PetriNetUnfolderBase]: For 3118/3118 co-relation queries the response was YES. [2024-11-19 01:33:51,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5960 conditions, 1997 events. 1321/1997 cut-off events. For 3118/3118 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9859 event pairs, 39 based on Foata normal form. 72/2039 useless extension candidates. Maximal degree in co-relation 5945. Up to 668 conditions per place. [2024-11-19 01:33:51,497 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 59 selfloop transitions, 18 changer transitions 1/97 dead transitions. [2024-11-19 01:33:51,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 97 transitions, 494 flow [2024-11-19 01:33:51,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:33:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 01:33:51,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 241 transitions. [2024-11-19 01:33:51,499 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6885714285714286 [2024-11-19 01:33:51,499 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 238 flow. Second operand 7 states and 241 transitions. [2024-11-19 01:33:51,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 97 transitions, 494 flow [2024-11-19 01:33:51,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 97 transitions, 448 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-19 01:33:51,507 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow [2024-11-19 01:33:51,508 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2024-11-19 01:33:51,508 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2024-11-19 01:33:51,508 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow [2024-11-19 01:33:51,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:33:51,509 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:33:51,509 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:33:51,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:33:51,509 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 01:33:51,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:33:51,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1520466069, now seen corresponding path program 1 times [2024-11-19 01:33:51,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:33:51,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43515988] [2024-11-19 01:33:51,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:33:51,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:33:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:33:51,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:33:51,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:33:51,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43515988] [2024-11-19 01:33:51,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43515988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:33:51,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:33:51,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:33:51,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468284290] [2024-11-19 01:33:51,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:33:51,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:33:51,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:33:51,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:33:51,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:33:51,773 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50 [2024-11-19 01:33:51,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 248 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:33:51,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:33:51,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50 [2024-11-19 01:33:51,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:33:52,058 INFO L124 PetriNetUnfolderBase]: 1673/2965 cut-off events. [2024-11-19 01:33:52,059 INFO L125 PetriNetUnfolderBase]: For 1863/1965 co-relation queries the response was YES. [2024-11-19 01:33:52,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7224 conditions, 2965 events. 1673/2965 cut-off events. For 1863/1965 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 18686 event pairs, 694 based on Foata normal form. 16/2802 useless extension candidates. Maximal degree in co-relation 7208. Up to 1158 conditions per place. [2024-11-19 01:33:52,075 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 32 selfloop transitions, 2 changer transitions 14/80 dead transitions. [2024-11-19 01:33:52,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 80 transitions, 408 flow [2024-11-19 01:33:52,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:33:52,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:33:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2024-11-19 01:33:52,076 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.676 [2024-11-19 01:33:52,076 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 5 states and 169 transitions. [2024-11-19 01:33:52,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 80 transitions, 408 flow [2024-11-19 01:33:52,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 80 transitions, 302 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-11-19 01:33:52,087 INFO L231 Difference]: Finished difference. Result has 64 places, 56 transitions, 168 flow [2024-11-19 01:33:52,087 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2024-11-19 01:33:52,088 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2024-11-19 01:33:52,088 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 168 flow [2024-11-19 01:33:52,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:33:52,088 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:33:52,088 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:33:52,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:33:52,088 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 01:33:52,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:33:52,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1079016285, now seen corresponding path program 2 times [2024-11-19 01:33:52,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:33:52,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386005274] [2024-11-19 01:33:52,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:33:52,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:33:52,154 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 01:33:52,155 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:33:52,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:33:52,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:33:52,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386005274] [2024-11-19 01:33:52,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386005274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:33:52,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:33:52,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:33:52,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531134479] [2024-11-19 01:33:52,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:33:52,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:33:52,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:33:52,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:33:52,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:33:52,320 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50 [2024-11-19 01:33:52,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 168 flow. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:33:52,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:33:52,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50 [2024-11-19 01:33:52,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:33:52,871 INFO L124 PetriNetUnfolderBase]: 3261/5816 cut-off events. [2024-11-19 01:33:52,872 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2024-11-19 01:33:52,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11489 conditions, 5816 events. 3261/5816 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 42636 event pairs, 899 based on Foata normal form. 16/5347 useless extension candidates. Maximal degree in co-relation 11476. Up to 2029 conditions per place. [2024-11-19 01:33:52,909 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 45 selfloop transitions, 2 changer transitions 12/92 dead transitions. [2024-11-19 01:33:52,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 92 transitions, 370 flow [2024-11-19 01:33:52,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:33:52,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 01:33:52,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2024-11-19 01:33:52,910 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-11-19 01:33:52,911 INFO L175 Difference]: Start difference. First operand has 64 places, 56 transitions, 168 flow. Second operand 6 states and 204 transitions. [2024-11-19 01:33:52,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 92 transitions, 370 flow [2024-11-19 01:33:52,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 92 transitions, 362 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-19 01:33:52,916 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 179 flow [2024-11-19 01:33:52,917 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2024-11-19 01:33:52,917 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2024-11-19 01:33:52,917 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 179 flow [2024-11-19 01:33:52,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:33:52,918 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:33:52,918 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:33:52,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:33:52,918 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 01:33:52,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:33:52,919 INFO L85 PathProgramCache]: Analyzing trace with hash -581144505, now seen corresponding path program 3 times [2024-11-19 01:33:52,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:33:52,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922982699] [2024-11-19 01:33:52,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:33:52,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:33:52,956 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 01:33:52,956 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:33:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:33:53,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:33:53,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922982699] [2024-11-19 01:33:53,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922982699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:33:53,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:33:53,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:33:53,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446200266] [2024-11-19 01:33:53,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:33:53,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:33:53,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:33:53,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:33:53,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:33:53,363 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 50 [2024-11-19 01:33:53,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 179 flow. Second operand has 7 states, 7 states have (on average 28.428571428571427) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:33:53,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:33:53,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 50 [2024-11-19 01:33:53,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:33:54,006 INFO L124 PetriNetUnfolderBase]: 4160/7517 cut-off events. [2024-11-19 01:33:54,007 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-11-19 01:33:54,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14531 conditions, 7517 events. 4160/7517 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 60824 event pairs, 1505 based on Foata normal form. 16/6610 useless extension candidates. Maximal degree in co-relation 14516. Up to 2409 conditions per place. [2024-11-19 01:33:54,029 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 35 selfloop transitions, 5 changer transitions 16/92 dead transitions. [2024-11-19 01:33:54,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 92 transitions, 367 flow [2024-11-19 01:33:54,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:33:54,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 01:33:54,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 265 transitions. [2024-11-19 01:33:54,031 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6625 [2024-11-19 01:33:54,031 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 179 flow. Second operand 8 states and 265 transitions. [2024-11-19 01:33:54,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 92 transitions, 367 flow [2024-11-19 01:33:54,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 92 transitions, 360 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-19 01:33:54,035 INFO L231 Difference]: Finished difference. Result has 76 places, 61 transitions, 213 flow [2024-11-19 01:33:54,036 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=76, PETRI_TRANSITIONS=61} [2024-11-19 01:33:54,036 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 18 predicate places. [2024-11-19 01:33:54,037 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 61 transitions, 213 flow [2024-11-19 01:33:54,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.428571428571427) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:33:54,038 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:33:54,038 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:33:54,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:33:54,038 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 01:33:54,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:33:54,038 INFO L85 PathProgramCache]: Analyzing trace with hash 678557371, now seen corresponding path program 4 times [2024-11-19 01:33:54,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:33:54,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418535907] [2024-11-19 01:33:54,039 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 01:33:54,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:33:54,060 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 01:33:54,061 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:33:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:33:54,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:33:54,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418535907] [2024-11-19 01:33:54,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418535907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:33:54,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:33:54,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:33:54,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818893203] [2024-11-19 01:33:54,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:33:54,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:33:54,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:33:54,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:33:54,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:33:54,189 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2024-11-19 01:33:54,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 61 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:33:54,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:33:54,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2024-11-19 01:33:54,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:33:55,599 INFO L124 PetriNetUnfolderBase]: 9097/16132 cut-off events. [2024-11-19 01:33:55,600 INFO L125 PetriNetUnfolderBase]: For 2786/2803 co-relation queries the response was YES. [2024-11-19 01:33:55,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34312 conditions, 16132 events. 9097/16132 cut-off events. For 2786/2803 co-relation queries the response was YES. Maximal size of possible extension queue 1249. Compared 142495 event pairs, 2446 based on Foata normal form. 19/14533 useless extension candidates. Maximal degree in co-relation 34293. Up to 6001 conditions per place. [2024-11-19 01:33:55,657 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 24 selfloop transitions, 1 changer transitions 47/105 dead transitions. [2024-11-19 01:33:55,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 105 transitions, 497 flow [2024-11-19 01:33:55,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:33:55,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 01:33:55,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 224 transitions. [2024-11-19 01:33:55,659 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.64 [2024-11-19 01:33:55,659 INFO L175 Difference]: Start difference. First operand has 76 places, 61 transitions, 213 flow. Second operand 7 states and 224 transitions. [2024-11-19 01:33:55,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 105 transitions, 497 flow [2024-11-19 01:33:55,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 105 transitions, 487 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-19 01:33:55,702 INFO L231 Difference]: Finished difference. Result has 80 places, 57 transitions, 201 flow [2024-11-19 01:33:55,702 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=201, PETRI_PLACES=80, PETRI_TRANSITIONS=57} [2024-11-19 01:33:55,704 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 22 predicate places. [2024-11-19 01:33:55,704 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 57 transitions, 201 flow [2024-11-19 01:33:55,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:33:55,704 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:33:55,704 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:33:55,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 01:33:55,704 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 01:33:55,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:33:55,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1510436059, now seen corresponding path program 5 times [2024-11-19 01:33:55,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:33:55,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688811850] [2024-11-19 01:33:55,705 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 01:33:55,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:33:55,744 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 01:33:55,745 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 01:33:55,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:33:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:33:55,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:33:55,813 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:33:55,814 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-11-19 01:33:55,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-11-19 01:33:55,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-19 01:33:55,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-19 01:33:55,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-19 01:33:55,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-19 01:33:55,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-11-19 01:33:55,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 01:33:55,819 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-11-19 01:33:55,918 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 01:33:55,918 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:33:55,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:33:55 BasicIcfg [2024-11-19 01:33:55,924 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:33:55,924 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:33:55,925 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:33:55,925 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:33:55,925 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:33:47" (3/4) ... [2024-11-19 01:33:55,926 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 01:33:56,007 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 01:33:56,008 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:33:56,009 INFO L158 Benchmark]: Toolchain (without parser) took 9173.94ms. Allocated memory was 188.7MB in the beginning and 788.5MB in the end (delta: 599.8MB). Free memory was 160.2MB in the beginning and 432.0MB in the end (delta: -271.8MB). Peak memory consumption was 328.0MB. Max. memory is 16.1GB. [2024-11-19 01:33:56,009 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:33:56,009 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.94ms. Allocated memory is still 188.7MB. Free memory was 160.2MB in the beginning and 135.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-19 01:33:56,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.98ms. Allocated memory is still 188.7MB. Free memory was 134.0MB in the beginning and 131.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:33:56,010 INFO L158 Benchmark]: Boogie Preprocessor took 56.87ms. Allocated memory is still 188.7MB. Free memory was 131.9MB in the beginning and 128.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:33:56,010 INFO L158 Benchmark]: RCFGBuilder took 575.98ms. Allocated memory is still 188.7MB. Free memory was 128.8MB in the beginning and 79.5MB in the end (delta: 49.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-19 01:33:56,010 INFO L158 Benchmark]: TraceAbstraction took 7932.63ms. Allocated memory was 188.7MB in the beginning and 788.5MB in the end (delta: 599.8MB). Free memory was 79.5MB in the beginning and 450.9MB in the end (delta: -371.4MB). Peak memory consumption was 229.5MB. Max. memory is 16.1GB. [2024-11-19 01:33:56,010 INFO L158 Benchmark]: Witness Printer took 84.16ms. Allocated memory is still 788.5MB. Free memory was 450.9MB in the beginning and 432.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 01:33:56,011 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.94ms. Allocated memory is still 188.7MB. Free memory was 160.2MB in the beginning and 135.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.98ms. Allocated memory is still 188.7MB. Free memory was 134.0MB in the beginning and 131.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.87ms. Allocated memory is still 188.7MB. Free memory was 131.9MB in the beginning and 128.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 575.98ms. Allocated memory is still 188.7MB. Free memory was 128.8MB in the beginning and 79.5MB in the end (delta: 49.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7932.63ms. Allocated memory was 188.7MB in the beginning and 788.5MB in the end (delta: 599.8MB). Free memory was 79.5MB in the beginning and 450.9MB in the end (delta: -371.4MB). Peak memory consumption was 229.5MB. Max. memory is 16.1GB. * Witness Printer took 84.16ms. Allocated memory is still 788.5MB. Free memory was 450.9MB in the beginning and 432.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1029; [L857] FCALL, FORK 0 pthread_create(&t1029, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029=-4, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t1030; [L859] FCALL, FORK 0 pthread_create(&t1030, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029=-4, t1030=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t1031; [L861] FCALL, FORK 0 pthread_create(&t1031, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029=-4, t1030=-3, t1031=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t1032; [L863] FCALL, FORK 0 pthread_create(&t1032, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029=-4, t1030=-3, t1031=-2, t1032=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L825] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L831] 4 __unbuffered_p3_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029=-4, t1030=-3, t1031=-2, t1032=-1, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029=-4, t1030=-3, t1031=-2, t1032=-1, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029=-4, t1030=-3, t1031=-2, t1032=-1, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 7 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: 7.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 517 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 499 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1177 IncrementalHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 13 mSDtfsCounter, 1177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=5, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 731 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 proved your program to be incorrect! [2024-11-19 01:33:56,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE