./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix026.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix026.oepc.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 a107688f8a9743f96e4ba7fbbac745d7f444b48f461db6b6c74848593b202e05 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:23:03,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:23:03,544 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 09:23:03,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:23:03,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:23:03,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:23:03,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:23:03,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:23:03,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:23:03,575 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:23:03,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:23:03,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:23:03,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:23:03,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:23:03,577 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:23:03,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:23:03,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:23:03,578 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:23:03,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 09:23:03,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:23:03,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:23:03,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:23:03,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:23:03,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:23:03,581 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:23:03,581 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:23:03,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:23:03,582 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:23:03,582 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:23:03,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:23:03,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:23:03,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:23:03,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:23:03,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:23:03,584 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:23:03,584 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:23:03,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 09:23:03,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 09:23:03,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:23:03,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:23:03,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:23:03,590 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:23:03,590 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 -> a107688f8a9743f96e4ba7fbbac745d7f444b48f461db6b6c74848593b202e05 [2024-11-20 09:23:03,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:23:03,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:23:03,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:23:03,883 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:23:03,883 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:23:03,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix026.oepc.i [2024-11-20 09:23:05,427 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:23:05,661 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:23:05,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix026.oepc.i [2024-11-20 09:23:05,678 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c68a51323/0c20f476614b4070827c332c9602153f/FLAG84a1606d7 [2024-11-20 09:23:05,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c68a51323/0c20f476614b4070827c332c9602153f [2024-11-20 09:23:05,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:23:05,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:23:05,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:23:05,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:23:05,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:23:05,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:23:05" (1/1) ... [2024-11-20 09:23:05,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45d853d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:23:05, skipping insertion in model container [2024-11-20 09:23:05,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:23:05" (1/1) ... [2024-11-20 09:23:05,753 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:23:05,968 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/mix026.oepc.i[945,958] [2024-11-20 09:23:06,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:23:06,200 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:23:06,214 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/mix026.oepc.i[945,958] [2024-11-20 09:23:06,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:23:06,325 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:23:06,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:23:06 WrapperNode [2024-11-20 09:23:06,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:23:06,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:23:06,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:23:06,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:23:06,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:23:06" (1/1) ... [2024-11-20 09:23:06,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:23:06" (1/1) ... [2024-11-20 09:23:06,386 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2024-11-20 09:23:06,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:23:06,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:23:06,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:23:06,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:23:06,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:23:06" (1/1) ... [2024-11-20 09:23:06,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:23:06" (1/1) ... [2024-11-20 09:23:06,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:23:06" (1/1) ... [2024-11-20 09:23:06,448 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-20 09:23:06,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:23:06" (1/1) ... [2024-11-20 09:23:06,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:23:06" (1/1) ... [2024-11-20 09:23:06,456 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:23:06" (1/1) ... [2024-11-20 09:23:06,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:23:06" (1/1) ... [2024-11-20 09:23:06,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:23:06" (1/1) ... [2024-11-20 09:23:06,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:23:06" (1/1) ... [2024-11-20 09:23:06,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:23:06,465 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:23:06,465 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:23:06,465 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:23:06,469 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:23:06" (1/1) ... [2024-11-20 09:23:06,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:23:06,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:23:06,511 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-20 09:23:06,516 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-20 09:23:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-20 09:23:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:23:06,569 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-20 09:23:06,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-20 09:23:06,570 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-20 09:23:06,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-20 09:23:06,570 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-20 09:23:06,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-20 09:23:06,570 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-20 09:23:06,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-20 09:23:06,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 09:23:06,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-20 09:23:06,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:23:06,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:23:06,575 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 09:23:06,749 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:23:06,751 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:23:07,167 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 09:23:07,168 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:23:07,381 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:23:07,382 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 09:23:07,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:23:07 BoogieIcfgContainer [2024-11-20 09:23:07,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:23:07,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:23:07,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:23:07,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:23:07,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:23:05" (1/3) ... [2024-11-20 09:23:07,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57462f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:23:07, skipping insertion in model container [2024-11-20 09:23:07,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:23:06" (2/3) ... [2024-11-20 09:23:07,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57462f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:23:07, skipping insertion in model container [2024-11-20 09:23:07,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:23:07" (3/3) ... [2024-11-20 09:23:07,395 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026.oepc.i [2024-11-20 09:23:07,414 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:23:07,415 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 09:23:07,415 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 09:23:07,497 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 09:23:07,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow [2024-11-20 09:23:07,578 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-11-20 09:23:07,578 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 09:23:07,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 1/45 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/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-11-20 09:23:07,586 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow [2024-11-20 09:23:07,592 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow [2024-11-20 09:23:07,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:23:07,621 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;@5ef06c6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:23:07,622 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-20 09:23:07,627 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 09:23:07,627 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-20 09:23:07,627 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 09:23:07,628 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:23:07,630 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-20 09:23:07,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:23:07,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:23:07,637 INFO L85 PathProgramCache]: Analyzing trace with hash 11962132, now seen corresponding path program 1 times [2024-11-20 09:23:07,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:23:07,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881723] [2024-11-20 09:23:07,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:23:07,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:23:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:23:08,135 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-20 09:23:08,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:23:08,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881723] [2024-11-20 09:23:08,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:23:08,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:23:08,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 09:23:08,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415017795] [2024-11-20 09:23:08,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:23:08,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:23:08,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:23:08,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:23:08,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:23:08,190 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 49 [2024-11-20 09:23:08,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:23:08,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:23:08,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 49 [2024-11-20 09:23:08,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:23:09,208 INFO L124 PetriNetUnfolderBase]: 2495/4136 cut-off events. [2024-11-20 09:23:09,208 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-20 09:23:09,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7712 conditions, 4136 events. 2495/4136 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 28631 event pairs, 443 based on Foata normal form. 135/4196 useless extension candidates. Maximal degree in co-relation 7700. Up to 2779 conditions per place. [2024-11-20 09:23:09,247 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 37 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2024-11-20 09:23:09,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 225 flow [2024-11-20 09:23:09,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:23:09,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 09:23:09,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-11-20 09:23:09,262 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7891156462585034 [2024-11-20 09:23:09,263 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 116 transitions. [2024-11-20 09:23:09,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 225 flow [2024-11-20 09:23:09,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 218 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-20 09:23:09,272 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 96 flow [2024-11-20 09:23:09,275 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, 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=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-11-20 09:23:09,280 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-11-20 09:23:09,280 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 96 flow [2024-11-20 09:23:09,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:23:09,281 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:23:09,281 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:23:09,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 09:23:09,281 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:23:09,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:23:09,283 INFO L85 PathProgramCache]: Analyzing trace with hash 898115753, now seen corresponding path program 1 times [2024-11-20 09:23:09,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:23:09,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938355761] [2024-11-20 09:23:09,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:23:09,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:23:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:23:09,590 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-20 09:23:09,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:23:09,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938355761] [2024-11-20 09:23:09,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938355761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:23:09,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:23:09,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:23:09,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577817887] [2024-11-20 09:23:09,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:23:09,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:23:09,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:23:09,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:23:09,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:23:09,602 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-20 09:23:09,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-20 09:23:09,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:23:09,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-20 09:23:09,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:23:11,324 INFO L124 PetriNetUnfolderBase]: 7779/12167 cut-off events. [2024-11-20 09:23:11,324 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2024-11-20 09:23:11,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23583 conditions, 12167 events. 7779/12167 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 86812 event pairs, 1033 based on Foata normal form. 400/12057 useless extension candidates. Maximal degree in co-relation 23573. Up to 5841 conditions per place. [2024-11-20 09:23:11,426 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 52 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2024-11-20 09:23:11,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 288 flow [2024-11-20 09:23:11,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:23:11,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 09:23:11,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2024-11-20 09:23:11,429 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6989795918367347 [2024-11-20 09:23:11,429 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 4 states and 137 transitions. [2024-11-20 09:23:11,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 288 flow [2024-11-20 09:23:11,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 09:23:11,433 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 134 flow [2024-11-20 09:23:11,433 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-11-20 09:23:11,434 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2024-11-20 09:23:11,434 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 134 flow [2024-11-20 09:23:11,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-20 09:23:11,435 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:23:11,435 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-20 09:23:11,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 09:23:11,436 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:23:11,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:23:11,436 INFO L85 PathProgramCache]: Analyzing trace with hash -2062269273, now seen corresponding path program 1 times [2024-11-20 09:23:11,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:23:11,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983011380] [2024-11-20 09:23:11,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:23:11,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:23:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:23:11,736 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-20 09:23:11,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:23:11,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983011380] [2024-11-20 09:23:11,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983011380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:23:11,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:23:11,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:23:11,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361295580] [2024-11-20 09:23:11,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:23:11,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:23:11,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:23:11,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:23:11,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:23:11,753 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-20 09:23:11,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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-20 09:23:11,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:23:11,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-20 09:23:11,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:23:12,987 INFO L124 PetriNetUnfolderBase]: 6075/9467 cut-off events. [2024-11-20 09:23:12,988 INFO L125 PetriNetUnfolderBase]: For 2276/2276 co-relation queries the response was YES. [2024-11-20 09:23:13,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21251 conditions, 9467 events. 6075/9467 cut-off events. For 2276/2276 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 63468 event pairs, 451 based on Foata normal form. 364/9459 useless extension candidates. Maximal degree in co-relation 21239. Up to 3681 conditions per place. [2024-11-20 09:23:13,074 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 67 selfloop transitions, 10 changer transitions 1/93 dead transitions. [2024-11-20 09:23:13,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 93 transitions, 413 flow [2024-11-20 09:23:13,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:23:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 09:23:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2024-11-20 09:23:13,078 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2024-11-20 09:23:13,078 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 134 flow. Second operand 5 states and 175 transitions. [2024-11-20 09:23:13,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 93 transitions, 413 flow [2024-11-20 09:23:13,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 402 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-20 09:23:13,087 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 186 flow [2024-11-20 09:23:13,087 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-11-20 09:23:13,088 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2024-11-20 09:23:13,088 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 186 flow [2024-11-20 09:23:13,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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-20 09:23:13,089 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:23:13,089 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-20 09:23:13,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 09:23:13,090 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:23:13,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:23:13,091 INFO L85 PathProgramCache]: Analyzing trace with hash -670886232, now seen corresponding path program 1 times [2024-11-20 09:23:13,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:23:13,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473663550] [2024-11-20 09:23:13,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:23:13,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:23:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:23:13,399 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-20 09:23:13,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:23:13,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473663550] [2024-11-20 09:23:13,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473663550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:23:13,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:23:13,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:23:13,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438375213] [2024-11-20 09:23:13,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:23:13,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:23:13,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:23:13,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:23:13,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:23:13,408 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-20 09:23:13,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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-20 09:23:13,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:23:13,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-20 09:23:13,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:23:14,342 INFO L124 PetriNetUnfolderBase]: 4027/6115 cut-off events. [2024-11-20 09:23:14,343 INFO L125 PetriNetUnfolderBase]: For 4654/4654 co-relation queries the response was YES. [2024-11-20 09:23:14,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15565 conditions, 6115 events. 4027/6115 cut-off events. For 4654/4654 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 35695 event pairs, 289 based on Foata normal form. 244/6140 useless extension candidates. Maximal degree in co-relation 15551. Up to 1788 conditions per place. [2024-11-20 09:23:14,388 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 80 selfloop transitions, 14 changer transitions 1/110 dead transitions. [2024-11-20 09:23:14,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 110 transitions, 544 flow [2024-11-20 09:23:14,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:23:14,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 09:23:14,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2024-11-20 09:23:14,391 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.717687074829932 [2024-11-20 09:23:14,391 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 186 flow. Second operand 6 states and 211 transitions. [2024-11-20 09:23:14,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 110 transitions, 544 flow [2024-11-20 09:23:14,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 110 transitions, 514 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-20 09:23:14,418 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 236 flow [2024-11-20 09:23:14,418 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2024-11-20 09:23:14,419 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2024-11-20 09:23:14,419 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 236 flow [2024-11-20 09:23:14,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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-20 09:23:14,419 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:23:14,420 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-20 09:23:14,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 09:23:14,420 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:23:14,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:23:14,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1494674115, now seen corresponding path program 1 times [2024-11-20 09:23:14,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:23:14,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760125713] [2024-11-20 09:23:14,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:23:14,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:23:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:23:14,833 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-20 09:23:14,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:23:14,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760125713] [2024-11-20 09:23:14,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760125713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:23:14,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:23:14,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:23:14,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422388066] [2024-11-20 09:23:14,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:23:14,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:23:14,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:23:14,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:23:14,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:23:14,849 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-20 09:23:14,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 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-20 09:23:14,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:23:14,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-20 09:23:14,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:23:15,705 INFO L124 PetriNetUnfolderBase]: 2863/4163 cut-off events. [2024-11-20 09:23:15,706 INFO L125 PetriNetUnfolderBase]: For 5022/5022 co-relation queries the response was YES. [2024-11-20 09:23:15,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11590 conditions, 4163 events. 2863/4163 cut-off events. For 5022/5022 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 21707 event pairs, 231 based on Foata normal form. 96/4120 useless extension candidates. Maximal degree in co-relation 11575. Up to 1316 conditions per place. [2024-11-20 09:23:15,752 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 71 selfloop transitions, 18 changer transitions 1/105 dead transitions. [2024-11-20 09:23:15,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 105 transitions, 534 flow [2024-11-20 09:23:15,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:23:15,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-20 09:23:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 225 transitions. [2024-11-20 09:23:15,755 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6559766763848397 [2024-11-20 09:23:15,755 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 236 flow. Second operand 7 states and 225 transitions. [2024-11-20 09:23:15,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 105 transitions, 534 flow [2024-11-20 09:23:15,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 105 transitions, 488 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-20 09:23:15,791 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 246 flow [2024-11-20 09:23:15,791 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=246, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2024-11-20 09:23:15,792 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2024-11-20 09:23:15,792 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 246 flow [2024-11-20 09:23:15,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 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-20 09:23:15,793 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:23:15,793 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] [2024-11-20 09:23:15,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 09:23:15,793 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:23:15,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:23:15,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1087284126, now seen corresponding path program 1 times [2024-11-20 09:23:15,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:23:15,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647710127] [2024-11-20 09:23:15,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:23:15,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:23:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:23:18,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:23:18,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:23:18,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647710127] [2024-11-20 09:23:18,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647710127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:23:18,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:23:18,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 09:23:18,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374641578] [2024-11-20 09:23:18,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:23:18,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 09:23:18,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:23:18,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 09:23:18,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-20 09:23:18,100 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2024-11-20 09:23:18,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 246 flow. Second operand has 10 states, 10 states have (on average 24.0) internal successors, (240), 10 states have internal predecessors, (240), 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-20 09:23:18,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:23:18,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2024-11-20 09:23:18,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:23:18,996 INFO L124 PetriNetUnfolderBase]: 3094/5031 cut-off events. [2024-11-20 09:23:18,997 INFO L125 PetriNetUnfolderBase]: For 3253/3449 co-relation queries the response was YES. [2024-11-20 09:23:19,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12380 conditions, 5031 events. 3094/5031 cut-off events. For 3253/3449 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 32412 event pairs, 881 based on Foata normal form. 16/4720 useless extension candidates. Maximal degree in co-relation 12364. Up to 1279 conditions per place. [2024-11-20 09:23:19,048 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 73 selfloop transitions, 5 changer transitions 12/120 dead transitions. [2024-11-20 09:23:19,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 120 transitions, 594 flow [2024-11-20 09:23:19,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:23:19,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 09:23:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 267 transitions. [2024-11-20 09:23:19,051 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6811224489795918 [2024-11-20 09:23:19,051 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 246 flow. Second operand 8 states and 267 transitions. [2024-11-20 09:23:19,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 120 transitions, 594 flow [2024-11-20 09:23:19,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 120 transitions, 478 flow, removed 27 selfloop flow, removed 10 redundant places. [2024-11-20 09:23:19,086 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 184 flow [2024-11-20 09:23:19,086 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=184, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2024-11-20 09:23:19,087 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places. [2024-11-20 09:23:19,087 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 184 flow [2024-11-20 09:23:19,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.0) internal successors, (240), 10 states have internal predecessors, (240), 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-20 09:23:19,088 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:23:19,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] [2024-11-20 09:23:19,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 09:23:19,088 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:23:19,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:23:19,089 INFO L85 PathProgramCache]: Analyzing trace with hash 732044412, now seen corresponding path program 2 times [2024-11-20 09:23:19,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:23:19,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471542439] [2024-11-20 09:23:19,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:23:19,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:23:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:23:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:23:19,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:23:19,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471542439] [2024-11-20 09:23:19,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471542439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:23:19,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:23:19,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:23:19,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143293985] [2024-11-20 09:23:19,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:23:19,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:23:19,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:23:19,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:23:19,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:23:19,536 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-11-20 09:23:19,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 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-20 09:23:19,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:23:19,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-11-20 09:23:19,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:23:20,464 INFO L124 PetriNetUnfolderBase]: 6443/10426 cut-off events. [2024-11-20 09:23:20,464 INFO L125 PetriNetUnfolderBase]: For 1680/1680 co-relation queries the response was YES. [2024-11-20 09:23:20,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22675 conditions, 10426 events. 6443/10426 cut-off events. For 1680/1680 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 76434 event pairs, 1731 based on Foata normal form. 32/9717 useless extension candidates. Maximal degree in co-relation 22659. Up to 4223 conditions per place. [2024-11-20 09:23:20,549 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 56 selfloop transitions, 2 changer transitions 15/101 dead transitions. [2024-11-20 09:23:20,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 101 transitions, 460 flow [2024-11-20 09:23:20,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:23:20,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 09:23:20,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2024-11-20 09:23:20,551 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6360544217687075 [2024-11-20 09:23:20,551 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 184 flow. Second operand 6 states and 187 transitions. [2024-11-20 09:23:20,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 101 transitions, 460 flow [2024-11-20 09:23:20,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 101 transitions, 448 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-20 09:23:20,558 INFO L231 Difference]: Finished difference. Result has 71 places, 57 transitions, 187 flow [2024-11-20 09:23:20,558 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=71, PETRI_TRANSITIONS=57} [2024-11-20 09:23:20,559 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places. [2024-11-20 09:23:20,559 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 57 transitions, 187 flow [2024-11-20 09:23:20,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 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-20 09:23:20,559 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:23:20,560 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] [2024-11-20 09:23:20,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 09:23:20,560 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:23:20,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:23:20,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1281866544, now seen corresponding path program 3 times [2024-11-20 09:23:20,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:23:20,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674599827] [2024-11-20 09:23:20,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:23:20,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:23:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:23:20,995 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-20 09:23:20,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:23:20,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674599827] [2024-11-20 09:23:20,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674599827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:23:20,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:23:20,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:23:20,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830260414] [2024-11-20 09:23:20,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:23:20,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:23:20,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:23:20,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:23:20,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:23:21,030 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-11-20 09:23:21,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 57 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-20 09:23:21,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:23:21,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-11-20 09:23:21,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:23:23,403 INFO L124 PetriNetUnfolderBase]: 18523/28565 cut-off events. [2024-11-20 09:23:23,403 INFO L125 PetriNetUnfolderBase]: For 6681/6681 co-relation queries the response was YES. [2024-11-20 09:23:23,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64084 conditions, 28565 events. 18523/28565 cut-off events. For 6681/6681 co-relation queries the response was YES. Maximal size of possible extension queue 1489. Compared 212619 event pairs, 2391 based on Foata normal form. 32/27557 useless extension candidates. Maximal degree in co-relation 64067. Up to 11485 conditions per place. [2024-11-20 09:23:23,669 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 63 selfloop transitions, 11 changer transitions 23/121 dead transitions. [2024-11-20 09:23:23,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 121 transitions, 573 flow [2024-11-20 09:23:23,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:23:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-20 09:23:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 200 transitions. [2024-11-20 09:23:23,670 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5830903790087464 [2024-11-20 09:23:23,671 INFO L175 Difference]: Start difference. First operand has 71 places, 57 transitions, 187 flow. Second operand 7 states and 200 transitions. [2024-11-20 09:23:23,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 121 transitions, 573 flow [2024-11-20 09:23:23,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 121 transitions, 562 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-20 09:23:23,685 INFO L231 Difference]: Finished difference. Result has 75 places, 65 transitions, 262 flow [2024-11-20 09:23:23,685 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=75, PETRI_TRANSITIONS=65} [2024-11-20 09:23:23,686 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 18 predicate places. [2024-11-20 09:23:23,686 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 262 flow [2024-11-20 09:23:23,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-20 09:23:23,687 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:23:23,687 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] [2024-11-20 09:23:23,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 09:23:23,687 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:23:23,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:23:23,688 INFO L85 PathProgramCache]: Analyzing trace with hash 684928074, now seen corresponding path program 4 times [2024-11-20 09:23:23,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:23:23,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004760324] [2024-11-20 09:23:23,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:23:23,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:23:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:23:24,065 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-20 09:23:24,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:23:24,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004760324] [2024-11-20 09:23:24,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004760324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:23:24,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:23:24,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:23:24,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620383555] [2024-11-20 09:23:24,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:23:24,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:23:24,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:23:24,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:23:24,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:23:24,089 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-11-20 09:23:24,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 262 flow. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:23:24,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:23:24,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-11-20 09:23:24,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:23:25,917 INFO L124 PetriNetUnfolderBase]: 15133/23877 cut-off events. [2024-11-20 09:23:25,918 INFO L125 PetriNetUnfolderBase]: For 10266/10271 co-relation queries the response was YES. [2024-11-20 09:23:26,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58507 conditions, 23877 events. 15133/23877 cut-off events. For 10266/10271 co-relation queries the response was YES. Maximal size of possible extension queue 1429. Compared 181720 event pairs, 2879 based on Foata normal form. 36/22828 useless extension candidates. Maximal degree in co-relation 58487. Up to 9434 conditions per place. [2024-11-20 09:23:26,034 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 61 selfloop transitions, 8 changer transitions 46/139 dead transitions. [2024-11-20 09:23:26,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 139 transitions, 742 flow [2024-11-20 09:23:26,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:23:26,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 09:23:26,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 233 transitions. [2024-11-20 09:23:26,037 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5943877551020408 [2024-11-20 09:23:26,037 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 262 flow. Second operand 8 states and 233 transitions. [2024-11-20 09:23:26,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 139 transitions, 742 flow [2024-11-20 09:23:26,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 139 transitions, 732 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-20 09:23:26,052 INFO L231 Difference]: Finished difference. Result has 80 places, 61 transitions, 260 flow [2024-11-20 09:23:26,052 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=260, PETRI_PLACES=80, PETRI_TRANSITIONS=61} [2024-11-20 09:23:26,054 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places. [2024-11-20 09:23:26,055 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 61 transitions, 260 flow [2024-11-20 09:23:26,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:23:26,055 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:23:26,056 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] [2024-11-20 09:23:26,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 09:23:26,056 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:23:26,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:23:26,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1302602764, now seen corresponding path program 5 times [2024-11-20 09:23:26,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:23:26,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945581130] [2024-11-20 09:23:26,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:23:26,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:23:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:23:28,022 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-20 09:23:28,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:23:28,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945581130] [2024-11-20 09:23:28,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945581130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:23:28,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:23:28,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 09:23:28,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581023932] [2024-11-20 09:23:28,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:23:28,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 09:23:28,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:23:28,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 09:23:28,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-20 09:23:28,056 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2024-11-20 09:23:28,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 61 transitions, 260 flow. Second operand has 10 states, 10 states have (on average 24.0) internal successors, (240), 10 states have internal predecessors, (240), 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-20 09:23:28,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:23:28,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2024-11-20 09:23:28,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:23:29,275 INFO L124 PetriNetUnfolderBase]: 5643/9567 cut-off events. [2024-11-20 09:23:29,275 INFO L125 PetriNetUnfolderBase]: For 3193/3558 co-relation queries the response was YES. [2024-11-20 09:23:29,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21515 conditions, 9567 events. 5643/9567 cut-off events. For 3193/3558 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 70660 event pairs, 2280 based on Foata normal form. 131/8908 useless extension candidates. Maximal degree in co-relation 21492. Up to 3954 conditions per place. [2024-11-20 09:23:29,341 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 54 selfloop transitions, 6 changer transitions 15/109 dead transitions. [2024-11-20 09:23:29,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 109 transitions, 552 flow [2024-11-20 09:23:29,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:23:29,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 09:23:29,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 248 transitions. [2024-11-20 09:23:29,343 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6326530612244898 [2024-11-20 09:23:29,343 INFO L175 Difference]: Start difference. First operand has 80 places, 61 transitions, 260 flow. Second operand 8 states and 248 transitions. [2024-11-20 09:23:29,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 109 transitions, 552 flow [2024-11-20 09:23:29,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 109 transitions, 515 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-11-20 09:23:29,350 INFO L231 Difference]: Finished difference. Result has 80 places, 63 transitions, 275 flow [2024-11-20 09:23:29,351 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=275, PETRI_PLACES=80, PETRI_TRANSITIONS=63} [2024-11-20 09:23:29,352 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places. [2024-11-20 09:23:29,354 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 63 transitions, 275 flow [2024-11-20 09:23:29,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.0) internal successors, (240), 10 states have internal predecessors, (240), 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-20 09:23:29,355 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:23:29,355 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:23:29,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 09:23:29,355 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:23:29,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:23:29,356 INFO L85 PathProgramCache]: Analyzing trace with hash -686143238, now seen corresponding path program 6 times [2024-11-20 09:23:29,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:23:29,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134439542] [2024-11-20 09:23:29,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:23:29,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:23:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:23:29,668 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-20 09:23:29,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:23:29,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134439542] [2024-11-20 09:23:29,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134439542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:23:29,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:23:29,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:23:29,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686947082] [2024-11-20 09:23:29,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:23:29,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:23:29,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:23:29,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:23:29,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:23:29,683 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-11-20 09:23:29,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 63 transitions, 275 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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-20 09:23:29,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:23:29,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-11-20 09:23:29,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:23:31,059 INFO L124 PetriNetUnfolderBase]: 8607/14490 cut-off events. [2024-11-20 09:23:31,059 INFO L125 PetriNetUnfolderBase]: For 9054/9245 co-relation queries the response was YES. [2024-11-20 09:23:31,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34001 conditions, 14490 events. 8607/14490 cut-off events. For 9054/9245 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 111834 event pairs, 3053 based on Foata normal form. 86/13630 useless extension candidates. Maximal degree in co-relation 33977. Up to 7533 conditions per place. [2024-11-20 09:23:31,160 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 37 selfloop transitions, 2 changer transitions 24/91 dead transitions. [2024-11-20 09:23:31,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 91 transitions, 495 flow [2024-11-20 09:23:31,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:23:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 09:23:31,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2024-11-20 09:23:31,163 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6244897959183674 [2024-11-20 09:23:31,163 INFO L175 Difference]: Start difference. First operand has 80 places, 63 transitions, 275 flow. Second operand 5 states and 153 transitions. [2024-11-20 09:23:31,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 91 transitions, 495 flow [2024-11-20 09:23:31,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 91 transitions, 473 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-11-20 09:23:31,180 INFO L231 Difference]: Finished difference. Result has 80 places, 58 transitions, 234 flow [2024-11-20 09:23:31,180 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=234, PETRI_PLACES=80, PETRI_TRANSITIONS=58} [2024-11-20 09:23:31,181 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places. [2024-11-20 09:23:31,181 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 58 transitions, 234 flow [2024-11-20 09:23:31,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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-20 09:23:31,181 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:23:31,182 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] [2024-11-20 09:23:31,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 09:23:31,182 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:23:31,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:23:31,183 INFO L85 PathProgramCache]: Analyzing trace with hash 651349274, now seen corresponding path program 7 times [2024-11-20 09:23:31,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:23:31,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231159057] [2024-11-20 09:23:31,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:23:31,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:23:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:23:31,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 09:23:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:23:31,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 09:23:31,380 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 09:23:31,382 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-11-20 09:23:31,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-11-20 09:23:31,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-20 09:23:31,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-20 09:23:31,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-20 09:23:31,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-20 09:23:31,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-11-20 09:23:31,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 09:23:31,385 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1] [2024-11-20 09:23:31,506 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 09:23:31,507 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 09:23:31,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:23:31 BasicIcfg [2024-11-20 09:23:31,513 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 09:23:31,514 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 09:23:31,514 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 09:23:31,514 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 09:23:31,515 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:23:07" (3/4) ... [2024-11-20 09:23:31,516 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-20 09:23:31,639 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 09:23:31,639 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 09:23:31,640 INFO L158 Benchmark]: Toolchain (without parser) took 25944.37ms. Allocated memory was 176.2MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 118.1MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 591.8MB. Max. memory is 16.1GB. [2024-11-20 09:23:31,640 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 09:23:31,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 630.00ms. Allocated memory is still 176.2MB. Free memory was 118.1MB in the beginning and 90.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-20 09:23:31,641 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.22ms. Allocated memory is still 176.2MB. Free memory was 90.8MB in the beginning and 88.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 09:23:31,641 INFO L158 Benchmark]: Boogie Preprocessor took 77.22ms. Allocated memory is still 176.2MB. Free memory was 88.2MB in the beginning and 84.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 09:23:31,641 INFO L158 Benchmark]: RCFGBuilder took 917.31ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 84.5MB in the beginning and 174.9MB in the end (delta: -90.4MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2024-11-20 09:23:31,641 INFO L158 Benchmark]: TraceAbstraction took 24128.30ms. Allocated memory was 247.5MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 174.9MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 556.9MB. Max. memory is 16.1GB. [2024-11-20 09:23:31,642 INFO L158 Benchmark]: Witness Printer took 125.75ms. Allocated memory is still 2.5GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-20 09:23:31,647 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 630.00ms. Allocated memory is still 176.2MB. Free memory was 118.1MB in the beginning and 90.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.22ms. Allocated memory is still 176.2MB. Free memory was 90.8MB in the beginning and 88.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.22ms. Allocated memory is still 176.2MB. Free memory was 88.2MB in the beginning and 84.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 917.31ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 84.5MB in the beginning and 174.9MB in the end (delta: -90.4MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * TraceAbstraction took 24128.30ms. Allocated memory was 247.5MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 174.9MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 556.9MB. Max. memory is 16.1GB. * Witness Printer took 125.75ms. Allocated memory is still 2.5GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 19.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_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t681; [L867] FCALL, FORK 0 pthread_create(&t681, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t681=-4, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t682; [L869] FCALL, FORK 0 pthread_create(&t682, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t681=-4, t682=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t683; [L871] FCALL, FORK 0 pthread_create(&t683, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t681=-4, t682=-3, t683=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t684; [L873] FCALL, FORK 0 pthread_create(&t684, ((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_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t681=-4, t682=-3, t683=-2, t684=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L802] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L805] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L822] 4 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L825] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$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_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 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_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L795] 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_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L815] 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_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L875] 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_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t681=-4, t682=-3, t683=-2, t684=-1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t681=-4, t682=-3, t683=-2, t684=-1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L886] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __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_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t681=-4, t682=-3, t683=-2, t684=-1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L888] 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_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [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_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] - 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: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 83 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: 23.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 840 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 795 mSDsluCounter, 357 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 332 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2122 IncrementalHoareTripleChecker+Invalid, 2201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 25 mSDtfsCounter, 2122 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=275occurred in iteration=10, InterpolantAutomatonStates: 67, 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, 1.0s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 309 ConstructedInterpolants, 0 QuantifiedInterpolants, 2076 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-20 09:23:31,671 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