./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55735e86-aa67-4edc-a512-0d61fcc65623/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55735e86-aa67-4edc-a512-0d61fcc65623/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55735e86-aa67-4edc-a512-0d61fcc65623/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55735e86-aa67-4edc-a512-0d61fcc65623/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55735e86-aa67-4edc-a512-0d61fcc65623/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55735e86-aa67-4edc-a512-0d61fcc65623/bin/uautomizer-verify-VRDe98Ueme --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 9ec75f624fee0326f6dc01ebf4c0afe8f65e83cfa5c5726cd79e55765f7366f9 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:04:14,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:04:14,547 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55735e86-aa67-4edc-a512-0d61fcc65623/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 12:04:14,551 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:04:14,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:04:14,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:04:14,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:04:14,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:04:14,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:04:14,579 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:04:14,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:04:14,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:04:14,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:04:14,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:04:14,582 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:04:14,583 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:04:14,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 12:04:14,584 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:04:14,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:04:14,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:04:14,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:04:14,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 12:04:14,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:04:14,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 12:04:14,588 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:04:14,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 12:04:14,589 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:04:14,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:04:14,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:04:14,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:04:14,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:04:14,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:04:14,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:04:14,593 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:04:14,593 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 12:04:14,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:04:14,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 12:04:14,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:04:14,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:04:14,594 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 12:04:14,595 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:04:14,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:04:14,595 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55735e86-aa67-4edc-a512-0d61fcc65623/bin/uautomizer-verify-VRDe98Ueme/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55735e86-aa67-4edc-a512-0d61fcc65623/bin/uautomizer-verify-VRDe98Ueme 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 -> 9ec75f624fee0326f6dc01ebf4c0afe8f65e83cfa5c5726cd79e55765f7366f9 [2023-11-26 12:04:14,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:04:14,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:04:14,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:04:14,930 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:04:14,930 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:04:14,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55735e86-aa67-4edc-a512-0d61fcc65623/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i [2023-11-26 12:04:18,091 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:04:18,415 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:04:18,416 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55735e86-aa67-4edc-a512-0d61fcc65623/sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i [2023-11-26 12:04:18,439 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55735e86-aa67-4edc-a512-0d61fcc65623/bin/uautomizer-verify-VRDe98Ueme/data/39ccf2f40/6bfcc36c8a264f4a9fbfc9b4499a3309/FLAGfe9f841d3 [2023-11-26 12:04:18,458 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55735e86-aa67-4edc-a512-0d61fcc65623/bin/uautomizer-verify-VRDe98Ueme/data/39ccf2f40/6bfcc36c8a264f4a9fbfc9b4499a3309 [2023-11-26 12:04:18,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:04:18,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:04:18,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:04:18,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:04:18,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:04:18,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:04:18" (1/1) ... [2023-11-26 12:04:18,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1743af16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:18, skipping insertion in model container [2023-11-26 12:04:18,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:04:18" (1/1) ... [2023-11-26 12:04:18,571 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:04:18,865 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55735e86-aa67-4edc-a512-0d61fcc65623/sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i[949,962] [2023-11-26 12:04:19,315 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:04:19,336 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:04:19,360 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55735e86-aa67-4edc-a512-0d61fcc65623/sv-benchmarks/c/pthread-wmm/mix055_tso.oepc.i[949,962] [2023-11-26 12:04:19,485 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:04:19,539 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:04:19,539 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:04:19,548 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:04:19,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:19 WrapperNode [2023-11-26 12:04:19,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:04:19,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:04:19,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:04:19,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:04:19,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:19" (1/1) ... [2023-11-26 12:04:19,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:19" (1/1) ... [2023-11-26 12:04:19,640 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2023-11-26 12:04:19,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:04:19,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:04:19,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:04:19,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:04:19,657 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:19" (1/1) ... [2023-11-26 12:04:19,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:19" (1/1) ... [2023-11-26 12:04:19,663 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:19" (1/1) ... [2023-11-26 12:04:19,696 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-26 12:04:19,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:19" (1/1) ... [2023-11-26 12:04:19,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:19" (1/1) ... [2023-11-26 12:04:19,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:19" (1/1) ... [2023-11-26 12:04:19,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:19" (1/1) ... [2023-11-26 12:04:19,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:19" (1/1) ... [2023-11-26 12:04:19,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:19" (1/1) ... [2023-11-26 12:04:19,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:04:19,742 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:04:19,742 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:04:19,742 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:04:19,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:19" (1/1) ... [2023-11-26 12:04:19,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:04:19,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55735e86-aa67-4edc-a512-0d61fcc65623/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:04:19,796 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55735e86-aa67-4edc-a512-0d61fcc65623/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:04:19,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55735e86-aa67-4edc-a512-0d61fcc65623/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:04:19,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 12:04:19,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 12:04:19,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 12:04:19,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 12:04:19,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-26 12:04:19,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 12:04:19,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:04:19,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 12:04:19,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 12:04:19,855 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 12:04:19,855 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 12:04:19,855 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 12:04:19,855 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 12:04:19,855 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 12:04:19,856 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 12:04:19,856 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-26 12:04:19,856 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-26 12:04:19,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 12:04:19,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 12:04:19,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 12:04:19,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 12:04:19,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-26 12:04:19,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 12:04:19,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:04:19,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:04:19,860 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 12:04:20,071 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:04:20,074 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:04:20,653 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:04:20,984 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:04:20,984 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 12:04:20,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:04:20 BoogieIcfgContainer [2023-11-26 12:04:20,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:04:20,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:04:20,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:04:20,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:04:20,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:04:18" (1/3) ... [2023-11-26 12:04:20,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a5e327e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:04:20, skipping insertion in model container [2023-11-26 12:04:20,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:19" (2/3) ... [2023-11-26 12:04:20,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a5e327e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:04:20, skipping insertion in model container [2023-11-26 12:04:20,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:04:20" (3/3) ... [2023-11-26 12:04:21,001 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_tso.oepc.i [2023-11-26 12:04:21,011 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 12:04:21,021 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:04:21,021 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-26 12:04:21,022 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 12:04:21,089 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 12:04:21,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 48 transitions, 112 flow [2023-11-26 12:04:21,161 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2023-11-26 12:04:21,161 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:04:21,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2023-11-26 12:04:21,167 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 48 transitions, 112 flow [2023-11-26 12:04:21,180 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 44 transitions, 100 flow [2023-11-26 12:04:21,197 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:04:21,208 INFO L357 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, mHoare=true, 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;@df3137a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:04:21,208 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-26 12:04:21,223 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 12:04:21,223 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2023-11-26 12:04:21,223 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:04:21,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:21,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-26 12:04:21,225 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 12:04:21,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:21,233 INFO L85 PathProgramCache]: Analyzing trace with hash -750946876, now seen corresponding path program 1 times [2023-11-26 12:04:21,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:21,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520074289] [2023-11-26 12:04:21,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:21,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:21,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:21,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520074289] [2023-11-26 12:04:21,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520074289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:21,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:21,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:04:21,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422495302] [2023-11-26 12:04:21,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:21,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:04:22,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:22,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:04:22,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:04:22,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 48 [2023-11-26 12:04:22,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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) [2023-11-26 12:04:22,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:22,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 48 [2023-11-26 12:04:22,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:23,427 INFO L124 PetriNetUnfolderBase]: 2160/3608 cut-off events. [2023-11-26 12:04:23,427 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-26 12:04:23,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6737 conditions, 3608 events. 2160/3608 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 24644 event pairs, 384 based on Foata normal form. 108/3635 useless extension candidates. Maximal degree in co-relation 6725. Up to 2416 conditions per place. [2023-11-26 12:04:23,475 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 35 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2023-11-26 12:04:23,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 212 flow [2023-11-26 12:04:23,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:04:23,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:04:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-26 12:04:23,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2023-11-26 12:04:23,493 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-26 12:04:23,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-26 12:04:23,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:23,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-26 12:04:23,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 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) [2023-11-26 12:04:23,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 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) [2023-11-26 12:04:23,506 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 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) [2023-11-26 12:04:23,509 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 111 transitions. [2023-11-26 12:04:23,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 212 flow [2023-11-26 12:04:23,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 206 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 12:04:23,518 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 94 flow [2023-11-26 12:04:23,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, 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=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-11-26 12:04:23,525 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places. [2023-11-26 12:04:23,526 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 94 flow [2023-11-26 12:04:23,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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) [2023-11-26 12:04:23,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:23,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:23,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 12:04:23,528 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 12:04:23,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:23,528 INFO L85 PathProgramCache]: Analyzing trace with hash -766607352, now seen corresponding path program 1 times [2023-11-26 12:04:23,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:23,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992385622] [2023-11-26 12:04:23,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:23,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:24,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:24,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992385622] [2023-11-26 12:04:24,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992385622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:24,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:24,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:04:24,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890900186] [2023-11-26 12:04:24,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:24,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:04:24,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:24,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:04:24,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:04:24,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2023-11-26 12:04:24,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:24,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:24,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2023-11-26 12:04:24,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:26,535 INFO L124 PetriNetUnfolderBase]: 7149/10747 cut-off events. [2023-11-26 12:04:26,536 INFO L125 PetriNetUnfolderBase]: For 512/512 co-relation queries the response was YES. [2023-11-26 12:04:26,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21271 conditions, 10747 events. 7149/10747 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 72522 event pairs, 869 based on Foata normal form. 320/10595 useless extension candidates. Maximal degree in co-relation 21261. Up to 5881 conditions per place. [2023-11-26 12:04:26,749 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 50 selfloop transitions, 6 changer transitions 1/71 dead transitions. [2023-11-26 12:04:26,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 71 transitions, 278 flow [2023-11-26 12:04:26,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:04:26,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 12:04:26,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2023-11-26 12:04:26,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6822916666666666 [2023-11-26 12:04:26,758 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 131 transitions. [2023-11-26 12:04:26,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 131 transitions. [2023-11-26 12:04:26,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:26,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 131 transitions. [2023-11-26 12:04:26,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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) [2023-11-26 12:04:26,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 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) [2023-11-26 12:04:26,767 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 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) [2023-11-26 12:04:26,768 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 4 states and 131 transitions. [2023-11-26 12:04:26,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 71 transitions, 278 flow [2023-11-26 12:04:26,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:04:26,777 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 132 flow [2023-11-26 12:04:26,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2023-11-26 12:04:26,779 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2023-11-26 12:04:26,779 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 132 flow [2023-11-26 12:04:26,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:26,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:26,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:26,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 12:04:26,781 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 12:04:26,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:26,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1170285520, now seen corresponding path program 1 times [2023-11-26 12:04:26,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:26,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624557967] [2023-11-26 12:04:26,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:26,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:27,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:27,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:27,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624557967] [2023-11-26 12:04:27,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624557967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:27,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:27,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:04:27,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367199823] [2023-11-26 12:04:27,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:27,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:04:27,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:27,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:04:27,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:04:27,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2023-11-26 12:04:27,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:27,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:27,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2023-11-26 12:04:27,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:29,123 INFO L124 PetriNetUnfolderBase]: 5601/8471 cut-off events. [2023-11-26 12:04:29,123 INFO L125 PetriNetUnfolderBase]: For 2076/2076 co-relation queries the response was YES. [2023-11-26 12:04:29,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19313 conditions, 8471 events. 5601/8471 cut-off events. For 2076/2076 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 54430 event pairs, 369 based on Foata normal form. 296/8407 useless extension candidates. Maximal degree in co-relation 19301. Up to 3901 conditions per place. [2023-11-26 12:04:29,287 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 64 selfloop transitions, 10 changer transitions 1/89 dead transitions. [2023-11-26 12:04:29,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 89 transitions, 399 flow [2023-11-26 12:04:29,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:04:29,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 12:04:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2023-11-26 12:04:29,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6958333333333333 [2023-11-26 12:04:29,297 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 167 transitions. [2023-11-26 12:04:29,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 167 transitions. [2023-11-26 12:04:29,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:29,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 167 transitions. [2023-11-26 12:04:29,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 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) [2023-11-26 12:04:29,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 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) [2023-11-26 12:04:29,304 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 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) [2023-11-26 12:04:29,304 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 132 flow. Second operand 5 states and 167 transitions. [2023-11-26 12:04:29,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 89 transitions, 399 flow [2023-11-26 12:04:29,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 89 transitions, 388 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-26 12:04:29,317 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 184 flow [2023-11-26 12:04:29,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2023-11-26 12:04:29,319 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2023-11-26 12:04:29,319 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 184 flow [2023-11-26 12:04:29,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:29,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:29,320 INFO L208 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] [2023-11-26 12:04:29,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 12:04:29,321 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 12:04:29,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:29,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1054724602, now seen corresponding path program 1 times [2023-11-26 12:04:29,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:29,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222596349] [2023-11-26 12:04:29,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:29,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:29,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:29,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:29,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222596349] [2023-11-26 12:04:29,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222596349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:29,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:29,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:04:29,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876442185] [2023-11-26 12:04:29,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:29,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:04:29,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:29,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:04:29,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:04:29,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2023-11-26 12:04:29,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:29,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:29,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2023-11-26 12:04:29,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:31,261 INFO L124 PetriNetUnfolderBase]: 3613/5435 cut-off events. [2023-11-26 12:04:31,262 INFO L125 PetriNetUnfolderBase]: For 4025/4025 co-relation queries the response was YES. [2023-11-26 12:04:31,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13959 conditions, 5435 events. 3613/5435 cut-off events. For 4025/4025 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 31196 event pairs, 221 based on Foata normal form. 208/5420 useless extension candidates. Maximal degree in co-relation 13945. Up to 1501 conditions per place. [2023-11-26 12:04:31,327 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 76 selfloop transitions, 14 changer transitions 1/105 dead transitions. [2023-11-26 12:04:31,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 105 transitions, 526 flow [2023-11-26 12:04:31,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:04:31,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:04:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2023-11-26 12:04:31,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2023-11-26 12:04:31,331 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 201 transitions. [2023-11-26 12:04:31,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 201 transitions. [2023-11-26 12:04:31,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:31,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 201 transitions. [2023-11-26 12:04:31,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 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) [2023-11-26 12:04:31,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 48.0) internal successors, (336), 7 states have internal predecessors, (336), 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) [2023-11-26 12:04:31,337 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 48.0) internal successors, (336), 7 states have internal predecessors, (336), 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) [2023-11-26 12:04:31,337 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 184 flow. Second operand 6 states and 201 transitions. [2023-11-26 12:04:31,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 105 transitions, 526 flow [2023-11-26 12:04:31,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 105 transitions, 496 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-26 12:04:31,370 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 234 flow [2023-11-26 12:04:31,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2023-11-26 12:04:31,373 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places. [2023-11-26 12:04:31,374 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 234 flow [2023-11-26 12:04:31,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:31,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:31,376 INFO L208 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] [2023-11-26 12:04:31,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 12:04:31,377 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 12:04:31,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:31,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1986486821, now seen corresponding path program 1 times [2023-11-26 12:04:31,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:31,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619912158] [2023-11-26 12:04:31,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:31,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:31,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:31,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:31,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619912158] [2023-11-26 12:04:31,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619912158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:31,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:31,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:04:31,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321470753] [2023-11-26 12:04:31,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:31,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:04:31,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:31,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:04:31,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:04:31,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2023-11-26 12:04:31,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 234 flow. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:31,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:31,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2023-11-26 12:04:31,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:32,630 INFO L124 PetriNetUnfolderBase]: 2425/3551 cut-off events. [2023-11-26 12:04:32,630 INFO L125 PetriNetUnfolderBase]: For 4281/4281 co-relation queries the response was YES. [2023-11-26 12:04:32,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10008 conditions, 3551 events. 2425/3551 cut-off events. For 4281/4281 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 18358 event pairs, 173 based on Foata normal form. 88/3488 useless extension candidates. Maximal degree in co-relation 9993. Up to 1088 conditions per place. [2023-11-26 12:04:32,665 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 68 selfloop transitions, 18 changer transitions 1/101 dead transitions. [2023-11-26 12:04:32,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 101 transitions, 520 flow [2023-11-26 12:04:32,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 12:04:32,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 12:04:32,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 215 transitions. [2023-11-26 12:04:32,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6398809523809523 [2023-11-26 12:04:32,667 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 215 transitions. [2023-11-26 12:04:32,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 215 transitions. [2023-11-26 12:04:32,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:32,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 215 transitions. [2023-11-26 12:04:32,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 30.714285714285715) internal successors, (215), 7 states have internal predecessors, (215), 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) [2023-11-26 12:04:32,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 48.0) internal successors, (384), 8 states have internal predecessors, (384), 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) [2023-11-26 12:04:32,670 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 48.0) internal successors, (384), 8 states have internal predecessors, (384), 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) [2023-11-26 12:04:32,671 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 234 flow. Second operand 7 states and 215 transitions. [2023-11-26 12:04:32,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 101 transitions, 520 flow [2023-11-26 12:04:32,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 101 transitions, 474 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-26 12:04:32,716 INFO L231 Difference]: Finished difference. Result has 65 places, 53 transitions, 244 flow [2023-11-26 12:04:32,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=244, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2023-11-26 12:04:32,718 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 9 predicate places. [2023-11-26 12:04:32,718 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 244 flow [2023-11-26 12:04:32,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:32,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:32,719 INFO L208 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] [2023-11-26 12:04:32,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 12:04:32,719 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 12:04:32,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:32,721 INFO L85 PathProgramCache]: Analyzing trace with hash 492971492, now seen corresponding path program 1 times [2023-11-26 12:04:32,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:32,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450150732] [2023-11-26 12:04:32,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:32,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:33,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:33,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:33,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450150732] [2023-11-26 12:04:33,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450150732] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:33,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:33,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:04:33,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113413231] [2023-11-26 12:04:33,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:33,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:04:33,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:33,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:04:33,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:04:33,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2023-11-26 12:04:33,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:33,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:33,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2023-11-26 12:04:33,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:34,147 INFO L124 PetriNetUnfolderBase]: 2867/4680 cut-off events. [2023-11-26 12:04:34,147 INFO L125 PetriNetUnfolderBase]: For 2663/2854 co-relation queries the response was YES. [2023-11-26 12:04:34,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11317 conditions, 4680 events. 2867/4680 cut-off events. For 2663/2854 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 29086 event pairs, 726 based on Foata normal form. 16/4468 useless extension candidates. Maximal degree in co-relation 11301. Up to 2015 conditions per place. [2023-11-26 12:04:34,195 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 38 selfloop transitions, 1 changer transitions 23/90 dead transitions. [2023-11-26 12:04:34,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 90 transitions, 458 flow [2023-11-26 12:04:34,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:04:34,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:04:34,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2023-11-26 12:04:34,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2023-11-26 12:04:34,197 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 183 transitions. [2023-11-26 12:04:34,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 183 transitions. [2023-11-26 12:04:34,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:34,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 183 transitions. [2023-11-26 12:04:34,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 30.5) internal successors, (183), 6 states have internal predecessors, (183), 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) [2023-11-26 12:04:34,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 48.0) internal successors, (336), 7 states have internal predecessors, (336), 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) [2023-11-26 12:04:34,200 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 48.0) internal successors, (336), 7 states have internal predecessors, (336), 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) [2023-11-26 12:04:34,200 INFO L175 Difference]: Start difference. First operand has 65 places, 53 transitions, 244 flow. Second operand 6 states and 183 transitions. [2023-11-26 12:04:34,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 90 transitions, 458 flow [2023-11-26 12:04:34,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 90 transitions, 352 flow, removed 22 selfloop flow, removed 10 redundant places. [2023-11-26 12:04:34,265 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 159 flow [2023-11-26 12:04:34,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=159, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-26 12:04:34,269 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 8 predicate places. [2023-11-26 12:04:34,269 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 159 flow [2023-11-26 12:04:34,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:34,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:34,270 INFO L208 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] [2023-11-26 12:04:34,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 12:04:34,270 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 12:04:34,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:34,271 INFO L85 PathProgramCache]: Analyzing trace with hash -376539476, now seen corresponding path program 2 times [2023-11-26 12:04:34,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:34,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561709991] [2023-11-26 12:04:34,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:34,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:34,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:34,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:34,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561709991] [2023-11-26 12:04:34,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561709991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:34,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:34,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:04:34,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169829830] [2023-11-26 12:04:34,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:34,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:04:34,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:34,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:04:34,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:04:34,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2023-11-26 12:04:34,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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) [2023-11-26 12:04:34,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:34,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2023-11-26 12:04:34,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:35,975 INFO L124 PetriNetUnfolderBase]: 3905/6337 cut-off events. [2023-11-26 12:04:35,975 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2023-11-26 12:04:36,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12908 conditions, 6337 events. 3905/6337 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 41480 event pairs, 908 based on Foata normal form. 16/6078 useless extension candidates. Maximal degree in co-relation 12894. Up to 2578 conditions per place. [2023-11-26 12:04:36,027 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 39 selfloop transitions, 5 changer transitions 21/91 dead transitions. [2023-11-26 12:04:36,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 91 transitions, 379 flow [2023-11-26 12:04:36,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:04:36,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:04:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2023-11-26 12:04:36,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2023-11-26 12:04:36,030 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 174 transitions. [2023-11-26 12:04:36,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 174 transitions. [2023-11-26 12:04:36,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:36,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 174 transitions. [2023-11-26 12:04:36,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 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) [2023-11-26 12:04:36,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 48.0) internal successors, (336), 7 states have internal predecessors, (336), 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) [2023-11-26 12:04:36,034 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 48.0) internal successors, (336), 7 states have internal predecessors, (336), 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) [2023-11-26 12:04:36,034 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 159 flow. Second operand 6 states and 174 transitions. [2023-11-26 12:04:36,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 91 transitions, 379 flow [2023-11-26 12:04:36,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 91 transitions, 368 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-26 12:04:36,040 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 182 flow [2023-11-26 12:04:36,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=182, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-11-26 12:04:36,041 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 10 predicate places. [2023-11-26 12:04:36,042 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 182 flow [2023-11-26 12:04:36,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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) [2023-11-26 12:04:36,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:36,042 INFO L208 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] [2023-11-26 12:04:36,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 12:04:36,043 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 12:04:36,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:36,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1808377330, now seen corresponding path program 3 times [2023-11-26 12:04:36,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:36,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67122436] [2023-11-26 12:04:36,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:36,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:38,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:38,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:38,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67122436] [2023-11-26 12:04:38,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67122436] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:38,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:38,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-26 12:04:38,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304183032] [2023-11-26 12:04:38,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:38,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 12:04:38,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:38,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 12:04:38,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-26 12:04:38,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2023-11-26 12:04:38,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 182 flow. Second operand has 10 states, 10 states have (on average 19.4) internal successors, (194), 10 states have internal predecessors, (194), 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) [2023-11-26 12:04:38,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:38,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2023-11-26 12:04:38,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:39,470 INFO L124 PetriNetUnfolderBase]: 4792/7531 cut-off events. [2023-11-26 12:04:39,471 INFO L125 PetriNetUnfolderBase]: For 1072/1076 co-relation queries the response was YES. [2023-11-26 12:04:39,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16882 conditions, 7531 events. 4792/7531 cut-off events. For 1072/1076 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 47327 event pairs, 971 based on Foata normal form. 18/7173 useless extension candidates. Maximal degree in co-relation 16866. Up to 2848 conditions per place. [2023-11-26 12:04:39,537 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 68 selfloop transitions, 19 changer transitions 27/139 dead transitions. [2023-11-26 12:04:39,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 139 transitions, 646 flow [2023-11-26 12:04:39,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 12:04:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-26 12:04:39,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 283 transitions. [2023-11-26 12:04:39,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5895833333333333 [2023-11-26 12:04:39,540 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 283 transitions. [2023-11-26 12:04:39,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 283 transitions. [2023-11-26 12:04:39,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:39,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 283 transitions. [2023-11-26 12:04:39,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 28.3) internal successors, (283), 10 states have internal predecessors, (283), 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) [2023-11-26 12:04:39,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 48.0) internal successors, (528), 11 states have internal predecessors, (528), 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) [2023-11-26 12:04:39,543 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 48.0) internal successors, (528), 11 states have internal predecessors, (528), 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) [2023-11-26 12:04:39,544 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 182 flow. Second operand 10 states and 283 transitions. [2023-11-26 12:04:39,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 139 transitions, 646 flow [2023-11-26 12:04:39,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 139 transitions, 625 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-26 12:04:39,549 INFO L231 Difference]: Finished difference. Result has 77 places, 71 transitions, 307 flow [2023-11-26 12:04:39,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=307, PETRI_PLACES=77, PETRI_TRANSITIONS=71} [2023-11-26 12:04:39,551 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 21 predicate places. [2023-11-26 12:04:39,551 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 71 transitions, 307 flow [2023-11-26 12:04:39,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.4) internal successors, (194), 10 states have internal predecessors, (194), 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) [2023-11-26 12:04:39,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:39,551 INFO L208 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] [2023-11-26 12:04:39,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 12:04:39,552 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 12:04:39,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:39,553 INFO L85 PathProgramCache]: Analyzing trace with hash -631436420, now seen corresponding path program 4 times [2023-11-26 12:04:39,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:39,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596348807] [2023-11-26 12:04:39,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:39,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:40,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:04:40,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:40,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596348807] [2023-11-26 12:04:40,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596348807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:40,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:40,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:04:40,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089690328] [2023-11-26 12:04:40,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:40,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:04:40,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:40,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:04:40,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:04:40,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2023-11-26 12:04:40,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 71 transitions, 307 flow. Second operand has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 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) [2023-11-26 12:04:40,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:40,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2023-11-26 12:04:40,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:42,054 INFO L124 PetriNetUnfolderBase]: 7464/11923 cut-off events. [2023-11-26 12:04:42,054 INFO L125 PetriNetUnfolderBase]: For 10077/10189 co-relation queries the response was YES. [2023-11-26 12:04:42,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32456 conditions, 11923 events. 7464/11923 cut-off events. For 10077/10189 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 83972 event pairs, 1820 based on Foata normal form. 118/11374 useless extension candidates. Maximal degree in co-relation 32434. Up to 5116 conditions per place. [2023-11-26 12:04:42,147 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 44 selfloop transitions, 9 changer transitions 64/143 dead transitions. [2023-11-26 12:04:42,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 143 transitions, 852 flow [2023-11-26 12:04:42,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:04:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 12:04:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 218 transitions. [2023-11-26 12:04:42,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5677083333333334 [2023-11-26 12:04:42,150 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 218 transitions. [2023-11-26 12:04:42,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 218 transitions. [2023-11-26 12:04:42,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:42,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 218 transitions. [2023-11-26 12:04:42,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 27.25) internal successors, (218), 8 states have internal predecessors, (218), 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) [2023-11-26 12:04:42,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 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) [2023-11-26 12:04:42,153 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 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) [2023-11-26 12:04:42,153 INFO L175 Difference]: Start difference. First operand has 77 places, 71 transitions, 307 flow. Second operand 8 states and 218 transitions. [2023-11-26 12:04:42,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 143 transitions, 852 flow [2023-11-26 12:04:42,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 143 transitions, 837 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-26 12:04:42,183 INFO L231 Difference]: Finished difference. Result has 84 places, 65 transitions, 321 flow [2023-11-26 12:04:42,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=321, PETRI_PLACES=84, PETRI_TRANSITIONS=65} [2023-11-26 12:04:42,185 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 28 predicate places. [2023-11-26 12:04:42,185 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 65 transitions, 321 flow [2023-11-26 12:04:42,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 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) [2023-11-26 12:04:42,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:42,185 INFO L208 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] [2023-11-26 12:04:42,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 12:04:42,186 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 12:04:42,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:42,187 INFO L85 PathProgramCache]: Analyzing trace with hash -299699752, now seen corresponding path program 5 times [2023-11-26 12:04:42,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:42,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922470516] [2023-11-26 12:04:42,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:42,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:04:42,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:04:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:04:42,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:04:42,399 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 12:04:42,401 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-26 12:04:42,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-26 12:04:42,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-26 12:04:42,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-26 12:04:42,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-26 12:04:42,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-26 12:04:42,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-26 12:04:42,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 12:04:42,406 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2023-11-26 12:04:42,413 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 12:04:42,413 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 12:04:42,503 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-26 12:04:42,508 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 12:04:42,510 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 12:04:42,519 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-26 12:04:42,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:04:42 BasicIcfg [2023-11-26 12:04:42,566 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 12:04:42,567 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 12:04:42,567 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 12:04:42,567 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 12:04:42,568 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:04:20" (3/4) ... [2023-11-26 12:04:42,569 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-26 12:04:42,609 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-26 12:04:42,611 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 12:04:42,611 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 12:04:42,613 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-26 12:04:42,718 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55735e86-aa67-4edc-a512-0d61fcc65623/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 12:04:42,718 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 12:04:42,719 INFO L158 Benchmark]: Toolchain (without parser) took 24255.41ms. Allocated memory was 140.5MB in the beginning and 872.4MB in the end (delta: 731.9MB). Free memory was 97.8MB in the beginning and 632.1MB in the end (delta: -534.4MB). Peak memory consumption was 198.1MB. Max. memory is 16.1GB. [2023-11-26 12:04:42,719 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 140.5MB. Free memory is still 112.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:04:42,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1085.36ms. Allocated memory is still 140.5MB. Free memory was 97.3MB in the beginning and 72.6MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-26 12:04:42,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.24ms. Allocated memory is still 140.5MB. Free memory was 72.6MB in the beginning and 70.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 12:04:42,720 INFO L158 Benchmark]: Boogie Preprocessor took 99.34ms. Allocated memory is still 140.5MB. Free memory was 70.0MB in the beginning and 66.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 12:04:42,721 INFO L158 Benchmark]: RCFGBuilder took 1243.18ms. Allocated memory was 140.5MB in the beginning and 186.6MB in the end (delta: 46.1MB). Free memory was 66.3MB in the beginning and 117.5MB in the end (delta: -51.1MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2023-11-26 12:04:42,721 INFO L158 Benchmark]: TraceAbstraction took 21578.30ms. Allocated memory was 186.6MB in the beginning and 872.4MB in the end (delta: 685.8MB). Free memory was 116.5MB in the beginning and 650.0MB in the end (delta: -533.5MB). Peak memory consumption was 152.3MB. Max. memory is 16.1GB. [2023-11-26 12:04:42,722 INFO L158 Benchmark]: Witness Printer took 151.13ms. Allocated memory is still 872.4MB. Free memory was 650.0MB in the beginning and 632.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-26 12:04:42,725 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.27ms. Allocated memory is still 140.5MB. Free memory is still 112.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1085.36ms. Allocated memory is still 140.5MB. Free memory was 97.3MB in the beginning and 72.6MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.24ms. Allocated memory is still 140.5MB. Free memory was 72.6MB in the beginning and 70.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.34ms. Allocated memory is still 140.5MB. Free memory was 70.0MB in the beginning and 66.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1243.18ms. Allocated memory was 140.5MB in the beginning and 186.6MB in the end (delta: 46.1MB). Free memory was 66.3MB in the beginning and 117.5MB in the end (delta: -51.1MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * TraceAbstraction took 21578.30ms. Allocated memory was 186.6MB in the beginning and 872.4MB in the end (delta: 685.8MB). Free memory was 116.5MB in the beginning and 650.0MB in the end (delta: -533.5MB). Peak memory consumption was 152.3MB. Max. memory is 16.1GB. * Witness Printer took 151.13ms. Allocated memory is still 872.4MB. Free memory was 650.0MB in the beginning and 632.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff0_thd4; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$r_buff1_thd4; [L733] 0 _Bool x$read_delayed; [L734] 0 int *x$read_delayed_var; [L735] 0 int x$w_buff0; [L736] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff1; [L738] 0 _Bool x$w_buff1_used; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1481; [L847] FCALL, FORK 0 pthread_create(&t1481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1481={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L848] 0 pthread_t t1482; [L849] FCALL, FORK 0 pthread_create(&t1482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1481={5:0}, t1482={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L850] 0 pthread_t t1483; [L851] FCALL, FORK 0 pthread_create(&t1483, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1481={5:0}, t1482={6:0}, t1483={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L852] 0 pthread_t t1484; [L853] FCALL, FORK 0 pthread_create(&t1484, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L768] 2 x$w_buff1 = x$w_buff0 [L769] 2 x$w_buff0 = 2 [L770] 2 x$w_buff1_used = x$w_buff0_used [L771] 2 x$w_buff0_used = (_Bool)1 [L772] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L772] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L773] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L774] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L775] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L776] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L777] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L778] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L818] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L754] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L757] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L784] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L785] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L786] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L788] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L804] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L805] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L806] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L807] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L808] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L824] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L826] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L827] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L828] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 x$flush_delayed = weak$$choice2 [L869] 0 x$mem_tmp = x [L870] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L878] 0 x = x$flush_delayed ? x$mem_tmp : x [L879] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, 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: 849]: 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: 847]: 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: 853]: 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: 851]: 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, 81 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: 21.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 695 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 670 mSDsluCounter, 272 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 226 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1324 IncrementalHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 46 mSDtfsCounter, 1324 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=321occurred in iteration=9, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 235 ConstructedInterpolants, 0 QuantifiedInterpolants, 1400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-26 12:04:42,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55735e86-aa67-4edc-a512-0d61fcc65623/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE