./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi004.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_0dcbca90-ae99-40af-b8e2-8fbb84da5a79/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dcbca90-ae99-40af-b8e2-8fbb84da5a79/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_0dcbca90-ae99-40af-b8e2-8fbb84da5a79/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dcbca90-ae99-40af-b8e2-8fbb84da5a79/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi004.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dcbca90-ae99-40af-b8e2-8fbb84da5a79/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_0dcbca90-ae99-40af-b8e2-8fbb84da5a79/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 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:58:27,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:58:27,599 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dcbca90-ae99-40af-b8e2-8fbb84da5a79/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:58:27,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:58:27,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:58:27,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:58:27,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:58:27,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:58:27,663 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:58:27,671 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:58:27,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:58:27,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:58:27,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:58:27,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:58:27,674 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:58:27,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:58:27,675 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:58:27,676 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:58:27,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:58:27,676 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:58:27,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:58:27,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:58:27,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:58:27,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:58:27,679 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:58:27,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:58:27,680 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:58:27,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:58:27,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:58:27,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:58:27,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:58:27,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:58:27,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:58:27,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:58:27,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:58:27,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:58:27,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:58:27,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:58:27,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:58:27,685 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:58:27,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:58:27,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:58:27,686 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_0dcbca90-ae99-40af-b8e2-8fbb84da5a79/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_0dcbca90-ae99-40af-b8e2-8fbb84da5a79/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 -> 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590 [2023-11-26 11:58:27,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:58:28,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:58:28,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:58:28,033 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:58:28,034 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:58:28,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dcbca90-ae99-40af-b8e2-8fbb84da5a79/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/rfi004.i [2023-11-26 11:58:31,480 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:58:31,887 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:58:31,893 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dcbca90-ae99-40af-b8e2-8fbb84da5a79/sv-benchmarks/c/pthread-wmm/rfi004.i [2023-11-26 11:58:31,927 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dcbca90-ae99-40af-b8e2-8fbb84da5a79/bin/uautomizer-verify-VRDe98Ueme/data/946a09982/97f61a938efb41049ad386b4edc37033/FLAG8e536ca52 [2023-11-26 11:58:31,947 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dcbca90-ae99-40af-b8e2-8fbb84da5a79/bin/uautomizer-verify-VRDe98Ueme/data/946a09982/97f61a938efb41049ad386b4edc37033 [2023-11-26 11:58:31,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:58:31,958 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:58:31,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:58:31,961 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:58:31,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:58:31,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:58:31" (1/1) ... [2023-11-26 11:58:31,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a4bdd30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:31, skipping insertion in model container [2023-11-26 11:58:31,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:58:31" (1/1) ... [2023-11-26 11:58:32,043 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:58:32,249 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_0dcbca90-ae99-40af-b8e2-8fbb84da5a79/sv-benchmarks/c/pthread-wmm/rfi004.i[983,996] [2023-11-26 11:58:32,517 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:58:32,536 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:58:32,550 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_0dcbca90-ae99-40af-b8e2-8fbb84da5a79/sv-benchmarks/c/pthread-wmm/rfi004.i[983,996] [2023-11-26 11:58:32,623 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:58:32,669 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:58:32,670 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:58:32,677 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:58:32,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:32 WrapperNode [2023-11-26 11:58:32,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:58:32,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:58:32,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:58:32,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:58:32,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:32" (1/1) ... [2023-11-26 11:58:32,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:32" (1/1) ... [2023-11-26 11:58:32,750 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2023-11-26 11:58:32,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:58:32,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:58:32,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:58:32,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:58:32,769 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:32" (1/1) ... [2023-11-26 11:58:32,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:32" (1/1) ... [2023-11-26 11:58:32,788 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:32" (1/1) ... [2023-11-26 11:58:32,820 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-11-26 11:58:32,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:32" (1/1) ... [2023-11-26 11:58:32,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:32" (1/1) ... [2023-11-26 11:58:32,830 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:32" (1/1) ... [2023-11-26 11:58:32,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:32" (1/1) ... [2023-11-26 11:58:32,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:32" (1/1) ... [2023-11-26 11:58:32,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:32" (1/1) ... [2023-11-26 11:58:32,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:58:32,856 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:58:32,857 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:58:32,857 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:58:32,868 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:32" (1/1) ... [2023-11-26 11:58:32,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:58:32,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dcbca90-ae99-40af-b8e2-8fbb84da5a79/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:58:32,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dcbca90-ae99-40af-b8e2-8fbb84da5a79/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:58:32,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dcbca90-ae99-40af-b8e2-8fbb84da5a79/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:58:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:58:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:58:32,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 11:58:32,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 11:58:32,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:58:32,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:58:32,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:58:32,941 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 11:58:32,942 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 11:58:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 11:58:32,942 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 11:58:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:58:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:58:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 11:58:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 11:58:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:58:32,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:58:32,945 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 11:58:33,100 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:58:33,103 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:58:33,422 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:58:33,689 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:58:33,689 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 11:58:33,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:33 BoogieIcfgContainer [2023-11-26 11:58:33,690 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:58:33,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:58:33,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:58:33,697 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:58:33,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:58:31" (1/3) ... [2023-11-26 11:58:33,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73cc7861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:58:33, skipping insertion in model container [2023-11-26 11:58:33,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:32" (2/3) ... [2023-11-26 11:58:33,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73cc7861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:58:33, skipping insertion in model container [2023-11-26 11:58:33,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:33" (3/3) ... [2023-11-26 11:58:33,701 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004.i [2023-11-26 11:58:33,711 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 11:58:33,723 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:58:33,724 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-26 11:58:33,724 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:58:33,771 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:58:33,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 74 flow [2023-11-26 11:58:33,844 INFO L124 PetriNetUnfolderBase]: 1/31 cut-off events. [2023-11-26 11:58:33,844 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:58:33,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 1/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2023-11-26 11:58:33,848 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 74 flow [2023-11-26 11:58:33,852 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 31 transitions, 68 flow [2023-11-26 11:58:33,864 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:58:33,872 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;@515ea412, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:58:33,872 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-26 11:58:33,879 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:58:33,880 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2023-11-26 11:58:33,880 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:58:33,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:33,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-26 11:58:33,881 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-26 11:58:33,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:33,888 INFO L85 PathProgramCache]: Analyzing trace with hash 863592400, now seen corresponding path program 1 times [2023-11-26 11:58:33,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:33,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133119816] [2023-11-26 11:58:33,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:33,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:34,518 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 11:58:34,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:34,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133119816] [2023-11-26 11:58:34,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133119816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:34,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:34,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:58:34,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412074468] [2023-11-26 11:58:34,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:34,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:34,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:34,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:34,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:34,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 33 [2023-11-26 11:58:34,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 11:58:34,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:34,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 33 [2023-11-26 11:58:34,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:34,763 INFO L124 PetriNetUnfolderBase]: 95/269 cut-off events. [2023-11-26 11:58:34,763 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:58:34,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 269 events. 95/269 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1450 event pairs, 14 based on Foata normal form. 12/274 useless extension candidates. Maximal degree in co-relation 445. Up to 136 conditions per place. [2023-11-26 11:58:34,769 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 17 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-11-26 11:58:34,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 36 transitions, 120 flow [2023-11-26 11:58:34,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:34,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:34,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2023-11-26 11:58:34,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2023-11-26 11:58:34,787 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 75 transitions. [2023-11-26 11:58:34,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 75 transitions. [2023-11-26 11:58:34,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:34,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 75 transitions. [2023-11-26 11:58:34,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:34,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:34,803 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:34,805 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 68 flow. Second operand 3 states and 75 transitions. [2023-11-26 11:58:34,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 36 transitions, 120 flow [2023-11-26 11:58:34,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:34,813 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2023-11-26 11:58:34,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-11-26 11:58:34,822 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2023-11-26 11:58:34,822 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2023-11-26 11:58:34,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 11:58:34,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:34,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:34,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:58:34,824 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-26 11:58:34,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:34,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1473333189, now seen corresponding path program 1 times [2023-11-26 11:58:34,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:34,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663544414] [2023-11-26 11:58:34,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:34,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:35,207 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 11:58:35,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:35,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663544414] [2023-11-26 11:58:35,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663544414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:35,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:35,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:58:35,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928432215] [2023-11-26 11:58:35,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:35,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:58:35,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:35,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:58:35,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:58:35,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33 [2023-11-26 11:58:35,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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 11:58:35,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:35,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33 [2023-11-26 11:58:35,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:35,693 INFO L124 PetriNetUnfolderBase]: 252/525 cut-off events. [2023-11-26 11:58:35,694 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-11-26 11:58:35,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 525 events. 252/525 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3048 event pairs, 82 based on Foata normal form. 0/504 useless extension candidates. Maximal degree in co-relation 1005. Up to 278 conditions per place. [2023-11-26 11:58:35,701 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 22 selfloop transitions, 3 changer transitions 33/68 dead transitions. [2023-11-26 11:58:35,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 68 transitions, 274 flow [2023-11-26 11:58:35,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:58:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 11:58:35,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2023-11-26 11:58:35,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2023-11-26 11:58:35,706 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 156 transitions. [2023-11-26 11:58:35,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 156 transitions. [2023-11-26 11:58:35,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:35,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 156 transitions. [2023-11-26 11:58:35,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 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 11:58:35,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 33.0) internal successors, (297), 9 states have internal predecessors, (297), 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 11:58:35,716 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 33.0) internal successors, (297), 9 states have internal predecessors, (297), 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 11:58:35,719 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 8 states and 156 transitions. [2023-11-26 11:58:35,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 68 transitions, 274 flow [2023-11-26 11:58:35,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 68 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:35,725 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 93 flow [2023-11-26 11:58:35,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=93, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2023-11-26 11:58:35,727 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2023-11-26 11:58:35,728 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 93 flow [2023-11-26 11:58:35,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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 11:58:35,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:35,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:35,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:58:35,736 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-26 11:58:35,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:35,739 INFO L85 PathProgramCache]: Analyzing trace with hash 2085112659, now seen corresponding path program 1 times [2023-11-26 11:58:35,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:35,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975666357] [2023-11-26 11:58:35,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:35,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:36,180 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 11:58:36,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:36,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975666357] [2023-11-26 11:58:36,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975666357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:36,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:36,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:58:36,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164629198] [2023-11-26 11:58:36,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:36,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:58:36,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:36,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:58:36,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:58:36,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33 [2023-11-26 11:58:36,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 93 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:36,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:36,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33 [2023-11-26 11:58:36,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:36,527 INFO L124 PetriNetUnfolderBase]: 170/354 cut-off events. [2023-11-26 11:58:36,528 INFO L125 PetriNetUnfolderBase]: For 275/275 co-relation queries the response was YES. [2023-11-26 11:58:36,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 354 events. 170/354 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1856 event pairs, 54 based on Foata normal form. 12/359 useless extension candidates. Maximal degree in co-relation 901. Up to 204 conditions per place. [2023-11-26 11:58:36,537 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 20 selfloop transitions, 3 changer transitions 17/50 dead transitions. [2023-11-26 11:58:36,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 237 flow [2023-11-26 11:58:36,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:58:36,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 11:58:36,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2023-11-26 11:58:36,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5411255411255411 [2023-11-26 11:58:36,543 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 125 transitions. [2023-11-26 11:58:36,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 125 transitions. [2023-11-26 11:58:36,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:36,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 125 transitions. [2023-11-26 11:58:36,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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 11:58:36,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 33.0) internal successors, (264), 8 states have internal predecessors, (264), 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 11:58:36,550 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 33.0) internal successors, (264), 8 states have internal predecessors, (264), 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 11:58:36,551 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 93 flow. Second operand 7 states and 125 transitions. [2023-11-26 11:58:36,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 237 flow [2023-11-26 11:58:36,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 220 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-26 11:58:36,559 INFO L231 Difference]: Finished difference. Result has 47 places, 29 transitions, 103 flow [2023-11-26 11:58:36,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=103, PETRI_PLACES=47, PETRI_TRANSITIONS=29} [2023-11-26 11:58:36,563 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2023-11-26 11:58:36,563 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 29 transitions, 103 flow [2023-11-26 11:58:36,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:36,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:36,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:36,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:58:36,565 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-26 11:58:36,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:36,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1494956076, now seen corresponding path program 1 times [2023-11-26 11:58:36,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:36,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502899102] [2023-11-26 11:58:36,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:36,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:36,846 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 11:58:36,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:36,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502899102] [2023-11-26 11:58:36,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502899102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:36,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:36,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:58:36,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145900459] [2023-11-26 11:58:36,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:36,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:58:36,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:36,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:58:36,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:58:36,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33 [2023-11-26 11:58:36,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 29 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 11:58:36,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:36,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33 [2023-11-26 11:58:36,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:37,056 INFO L124 PetriNetUnfolderBase]: 162/346 cut-off events. [2023-11-26 11:58:37,056 INFO L125 PetriNetUnfolderBase]: For 272/274 co-relation queries the response was YES. [2023-11-26 11:58:37,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 346 events. 162/346 cut-off events. For 272/274 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1647 event pairs, 23 based on Foata normal form. 23/357 useless extension candidates. Maximal degree in co-relation 832. Up to 147 conditions per place. [2023-11-26 11:58:37,061 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 28 selfloop transitions, 4 changer transitions 1/45 dead transitions. [2023-11-26 11:58:37,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 215 flow [2023-11-26 11:58:37,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:58:37,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 11:58:37,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2023-11-26 11:58:37,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2023-11-26 11:58:37,064 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 90 transitions. [2023-11-26 11:58:37,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 90 transitions. [2023-11-26 11:58:37,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:37,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 90 transitions. [2023-11-26 11:58:37,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 11:58:37,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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 11:58:37,067 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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 11:58:37,067 INFO L175 Difference]: Start difference. First operand has 47 places, 29 transitions, 103 flow. Second operand 4 states and 90 transitions. [2023-11-26 11:58:37,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 215 flow [2023-11-26 11:58:37,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 199 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-26 11:58:37,072 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 113 flow [2023-11-26 11:58:37,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-11-26 11:58:37,073 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2023-11-26 11:58:37,074 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 113 flow [2023-11-26 11:58:37,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 11:58:37,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:37,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:37,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:58:37,075 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-26 11:58:37,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:37,076 INFO L85 PathProgramCache]: Analyzing trace with hash -962608269, now seen corresponding path program 1 times [2023-11-26 11:58:37,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:37,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032188911] [2023-11-26 11:58:37,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:37,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:37,281 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 11:58:37,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:37,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032188911] [2023-11-26 11:58:37,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032188911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:37,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:37,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:58:37,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078859631] [2023-11-26 11:58:37,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:37,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:58:37,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:37,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:58:37,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:58:37,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33 [2023-11-26 11:58:37,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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 11:58:37,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:37,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33 [2023-11-26 11:58:37,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:37,466 INFO L124 PetriNetUnfolderBase]: 87/196 cut-off events. [2023-11-26 11:58:37,466 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2023-11-26 11:58:37,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 196 events. 87/196 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 690 event pairs, 16 based on Foata normal form. 16/204 useless extension candidates. Maximal degree in co-relation 505. Up to 80 conditions per place. [2023-11-26 11:58:37,469 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 24 selfloop transitions, 6 changer transitions 1/43 dead transitions. [2023-11-26 11:58:37,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 210 flow [2023-11-26 11:58:37,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:58:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:58:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2023-11-26 11:58:37,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2023-11-26 11:58:37,472 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 102 transitions. [2023-11-26 11:58:37,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 102 transitions. [2023-11-26 11:58:37,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:37,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 102 transitions. [2023-11-26 11:58:37,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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 11:58:37,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 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 11:58:37,475 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 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 11:58:37,475 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 113 flow. Second operand 5 states and 102 transitions. [2023-11-26 11:58:37,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 210 flow [2023-11-26 11:58:37,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 182 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-26 11:58:37,479 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 114 flow [2023-11-26 11:58:37,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-11-26 11:58:37,481 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2023-11-26 11:58:37,481 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 114 flow [2023-11-26 11:58:37,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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 11:58:37,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:37,482 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] [2023-11-26 11:58:37,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:58:37,483 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-26 11:58:37,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:37,483 INFO L85 PathProgramCache]: Analyzing trace with hash -848640780, now seen corresponding path program 1 times [2023-11-26 11:58:37,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:37,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155688875] [2023-11-26 11:58:37,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:37,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:37,795 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 11:58:37,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:37,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155688875] [2023-11-26 11:58:37,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155688875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:37,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:37,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:58:37,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678661430] [2023-11-26 11:58:37,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:37,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:58:37,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:37,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:58:37,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:58:37,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33 [2023-11-26 11:58:37,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 114 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:37,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:37,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33 [2023-11-26 11:58:37,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:38,033 INFO L124 PetriNetUnfolderBase]: 110/276 cut-off events. [2023-11-26 11:58:38,033 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2023-11-26 11:58:38,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 276 events. 110/276 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1089 event pairs, 30 based on Foata normal form. 4/273 useless extension candidates. Maximal degree in co-relation 628. Up to 120 conditions per place. [2023-11-26 11:58:38,036 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 19 selfloop transitions, 1 changer transitions 19/51 dead transitions. [2023-11-26 11:58:38,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 240 flow [2023-11-26 11:58:38,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:58:38,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:58:38,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2023-11-26 11:58:38,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2023-11-26 11:58:38,039 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 110 transitions. [2023-11-26 11:58:38,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 110 transitions. [2023-11-26 11:58:38,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:38,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 110 transitions. [2023-11-26 11:58:38,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:38,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 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 11:58:38,041 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 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 11:58:38,042 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 114 flow. Second operand 6 states and 110 transitions. [2023-11-26 11:58:38,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 240 flow [2023-11-26 11:58:38,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 206 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-26 11:58:38,045 INFO L231 Difference]: Finished difference. Result has 46 places, 29 transitions, 89 flow [2023-11-26 11:58:38,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=89, PETRI_PLACES=46, PETRI_TRANSITIONS=29} [2023-11-26 11:58:38,047 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2023-11-26 11:58:38,047 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 89 flow [2023-11-26 11:58:38,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:38,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:38,048 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] [2023-11-26 11:58:38,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:58:38,049 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-26 11:58:38,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:38,049 INFO L85 PathProgramCache]: Analyzing trace with hash 892617788, now seen corresponding path program 2 times [2023-11-26 11:58:38,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:38,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075365097] [2023-11-26 11:58:38,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:38,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:38,671 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 11:58:38,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:38,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075365097] [2023-11-26 11:58:38,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075365097] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:38,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:38,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 11:58:38,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692184555] [2023-11-26 11:58:38,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:38,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:58:38,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:38,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:58:38,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:58:38,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33 [2023-11-26 11:58:38,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 89 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 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 11:58:38,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:38,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33 [2023-11-26 11:58:38,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:38,939 INFO L124 PetriNetUnfolderBase]: 67/183 cut-off events. [2023-11-26 11:58:38,940 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-26 11:58:38,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 183 events. 67/183 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 636 event pairs, 35 based on Foata normal form. 4/176 useless extension candidates. Maximal degree in co-relation 372. Up to 77 conditions per place. [2023-11-26 11:58:38,942 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 14 selfloop transitions, 2 changer transitions 17/47 dead transitions. [2023-11-26 11:58:38,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 197 flow [2023-11-26 11:58:38,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:58:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 11:58:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2023-11-26 11:58:38,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.553030303030303 [2023-11-26 11:58:38,945 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 146 transitions. [2023-11-26 11:58:38,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 146 transitions. [2023-11-26 11:58:38,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:38,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 146 transitions. [2023-11-26 11:58:38,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 18.25) internal successors, (146), 8 states have internal predecessors, (146), 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 11:58:38,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 33.0) internal successors, (297), 9 states have internal predecessors, (297), 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 11:58:38,948 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 33.0) internal successors, (297), 9 states have internal predecessors, (297), 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 11:58:38,948 INFO L175 Difference]: Start difference. First operand has 46 places, 29 transitions, 89 flow. Second operand 8 states and 146 transitions. [2023-11-26 11:58:38,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 197 flow [2023-11-26 11:58:38,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 184 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-11-26 11:58:38,951 INFO L231 Difference]: Finished difference. Result has 50 places, 29 transitions, 96 flow [2023-11-26 11:58:38,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=96, PETRI_PLACES=50, PETRI_TRANSITIONS=29} [2023-11-26 11:58:38,952 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 13 predicate places. [2023-11-26 11:58:38,952 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 29 transitions, 96 flow [2023-11-26 11:58:38,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 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 11:58:38,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:38,953 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] [2023-11-26 11:58:38,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:58:38,954 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-26 11:58:38,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:38,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1745742200, now seen corresponding path program 3 times [2023-11-26 11:58:38,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:38,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113661401] [2023-11-26 11:58:38,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:38,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:58:39,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:58:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:58:39,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:58:39,076 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:58:39,077 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-26 11:58:39,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-26 11:58:39,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-26 11:58:39,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-26 11:58:39,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-26 11:58:39,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:58:39,081 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-11-26 11:58:39,087 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 11:58:39,088 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:58:39,134 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 11:58:39,139 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:58:39,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:58:39 BasicIcfg [2023-11-26 11:58:39,183 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:58:39,184 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:58:39,184 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:58:39,184 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:58:39,185 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:33" (3/4) ... [2023-11-26 11:58:39,186 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-26 11:58:39,220 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 11:58:39,228 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:58:39,323 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dcbca90-ae99-40af-b8e2-8fbb84da5a79/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 11:58:39,324 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:58:39,325 INFO L158 Benchmark]: Toolchain (without parser) took 7366.62ms. Allocated memory was 155.2MB in the beginning and 192.9MB in the end (delta: 37.7MB). Free memory was 113.5MB in the beginning and 108.7MB in the end (delta: 4.8MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2023-11-26 11:58:39,325 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 113.2MB. Free memory is still 63.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:58:39,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 717.98ms. Allocated memory is still 155.2MB. Free memory was 113.5MB in the beginning and 90.5MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-26 11:58:39,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.04ms. Allocated memory is still 155.2MB. Free memory was 90.5MB in the beginning and 88.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:58:39,327 INFO L158 Benchmark]: Boogie Preprocessor took 104.11ms. Allocated memory is still 155.2MB. Free memory was 88.3MB in the beginning and 85.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:58:39,327 INFO L158 Benchmark]: RCFGBuilder took 833.99ms. Allocated memory is still 155.2MB. Free memory was 85.3MB in the beginning and 100.1MB in the end (delta: -14.9MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2023-11-26 11:58:39,328 INFO L158 Benchmark]: TraceAbstraction took 5490.08ms. Allocated memory was 155.2MB in the beginning and 192.9MB in the end (delta: 37.7MB). Free memory was 99.3MB in the beginning and 117.1MB in the end (delta: -17.8MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2023-11-26 11:58:39,328 INFO L158 Benchmark]: Witness Printer took 139.83ms. Allocated memory is still 192.9MB. Free memory was 117.1MB in the beginning and 108.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-26 11:58:39,331 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.36ms. Allocated memory is still 113.2MB. Free memory is still 63.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 717.98ms. Allocated memory is still 155.2MB. Free memory was 113.5MB in the beginning and 90.5MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.04ms. Allocated memory is still 155.2MB. Free memory was 90.5MB in the beginning and 88.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.11ms. Allocated memory is still 155.2MB. Free memory was 88.3MB in the beginning and 85.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 833.99ms. Allocated memory is still 155.2MB. Free memory was 85.3MB in the beginning and 100.1MB in the end (delta: -14.9MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5490.08ms. Allocated memory was 155.2MB in the beginning and 192.9MB in the end (delta: 37.7MB). Free memory was 99.3MB in the beginning and 117.1MB in the end (delta: -17.8MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Witness Printer took 139.83ms. Allocated memory is still 192.9MB. Free memory was 117.1MB in the beginning and 108.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 The program execution was not completely translated back. - 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 The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1649; [L816] FCALL, FORK 0 pthread_create(&t1649, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1649={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t1650; [L818] FCALL, FORK 0 pthread_create(&t1650, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1649={5:0}, t1650={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L773] 2 y$w_buff1 = y$w_buff0 [L774] 2 y$w_buff0 = 1 [L775] 2 y$w_buff1_used = y$w_buff0_used [L776] 2 y$w_buff0_used = (_Bool)1 [L777] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L777] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L778] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L779] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L780] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L781] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L784] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L787] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L790] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 1 y$flush_delayed = weak$$choice2 [L751] 1 y$mem_tmp = y [L752] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L753] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L754] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L755] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L756] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L758] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 __unbuffered_p0_EAX = y [L760] 1 y = y$flush_delayed ? y$mem_tmp : y [L761] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L793] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L794] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L795] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L796] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L797] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649={5:0}, t1650={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649={5:0}, t1650={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649={5:0}, t1650={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L19] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: 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: 816]: 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: 818]: 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 5 procedures, 53 locations, 5 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: 5.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 568 IncrementalHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 19 mSDtfsCounter, 568 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=5, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 482 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 11:58:39,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dcbca90-ae99-40af-b8e2-8fbb84da5a79/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