./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a6899d3-a00d-4ffd-a393-bfda9827da86/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a6899d3-a00d-4ffd-a393-bfda9827da86/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a6899d3-a00d-4ffd-a393-bfda9827da86/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a6899d3-a00d-4ffd-a393-bfda9827da86/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a6899d3-a00d-4ffd-a393-bfda9827da86/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a6899d3-a00d-4ffd-a393-bfda9827da86/bin/uautomizer-verify-uCwYo4JHxu --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 0b6ad05084ff5d70a22ef215b05587fd59d1867832386446579778aa62df8d63 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:38:23,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:38:23,687 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a6899d3-a00d-4ffd-a393-bfda9827da86/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:38:23,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:38:23,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:38:23,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:38:23,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:38:23,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:38:23,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:38:23,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:38:23,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:38:23,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:38:23,745 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:38:23,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:38:23,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:38:23,748 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:38:23,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:38:23,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:38:23,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:38:23,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:38:23,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:38:23,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:38:23,751 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:38:23,752 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:38:23,752 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:38:23,753 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:38:23,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:38:23,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:38:23,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:38:23,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:38:23,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:38:23,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:38:23,757 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:38:23,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:38:23,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:38:23,757 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:38:23,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:38:23,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:38:23,758 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:38:23,758 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_1a6899d3-a00d-4ffd-a393-bfda9827da86/bin/uautomizer-verify-uCwYo4JHxu/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_1a6899d3-a00d-4ffd-a393-bfda9827da86/bin/uautomizer-verify-uCwYo4JHxu 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 -> 0b6ad05084ff5d70a22ef215b05587fd59d1867832386446579778aa62df8d63 [2023-11-19 07:38:24,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:38:24,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:38:24,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:38:24,171 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:38:24,171 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:38:24,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a6899d3-a00d-4ffd-a393-bfda9827da86/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 07:38:27,415 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:38:27,766 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:38:27,767 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a6899d3-a00d-4ffd-a393-bfda9827da86/sv-benchmarks/c/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 07:38:27,784 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a6899d3-a00d-4ffd-a393-bfda9827da86/bin/uautomizer-verify-uCwYo4JHxu/data/c15705e51/4c5f6c6785144b11ad2a38840e844bd9/FLAGafd3d688b [2023-11-19 07:38:27,800 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a6899d3-a00d-4ffd-a393-bfda9827da86/bin/uautomizer-verify-uCwYo4JHxu/data/c15705e51/4c5f6c6785144b11ad2a38840e844bd9 [2023-11-19 07:38:27,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:38:27,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:38:27,806 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:38:27,806 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:38:27,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:38:27,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:38:27" (1/1) ... [2023-11-19 07:38:27,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cc91c32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:27, skipping insertion in model container [2023-11-19 07:38:27,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:38:27" (1/1) ... [2023-11-19 07:38:27,866 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:38:28,085 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_1a6899d3-a00d-4ffd-a393-bfda9827da86/sv-benchmarks/c/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-11-19 07:38:28,374 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:38:28,388 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:38:28,405 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_1a6899d3-a00d-4ffd-a393-bfda9827da86/sv-benchmarks/c/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-11-19 07:38:28,507 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:38:28,566 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:38:28,566 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:38:28,575 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:38:28,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:28 WrapperNode [2023-11-19 07:38:28,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:38:28,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:38:28,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:38:28,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:38:28,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:28" (1/1) ... [2023-11-19 07:38:28,636 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:28" (1/1) ... [2023-11-19 07:38:28,693 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-11-19 07:38:28,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:38:28,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:38:28,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:38:28,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:38:28,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:28" (1/1) ... [2023-11-19 07:38:28,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:28" (1/1) ... [2023-11-19 07:38:28,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:28" (1/1) ... [2023-11-19 07:38:28,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:28" (1/1) ... [2023-11-19 07:38:28,739 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:28" (1/1) ... [2023-11-19 07:38:28,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:28" (1/1) ... [2023-11-19 07:38:28,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:28" (1/1) ... [2023-11-19 07:38:28,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:28" (1/1) ... [2023-11-19 07:38:28,772 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:38:28,773 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:38:28,773 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:38:28,774 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:38:28,775 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:28" (1/1) ... [2023-11-19 07:38:28,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:38:28,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a6899d3-a00d-4ffd-a393-bfda9827da86/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:38:28,818 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a6899d3-a00d-4ffd-a393-bfda9827da86/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:38:28,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a6899d3-a00d-4ffd-a393-bfda9827da86/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:38:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:38:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:38:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:38:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:38:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:38:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:38:28,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:38:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:38:28,871 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:38:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:38:28,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:38:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:38:28,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:38:28,877 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:38:29,022 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:38:29,024 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:38:29,479 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:38:29,714 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:38:29,715 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:38:29,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:29 BoogieIcfgContainer [2023-11-19 07:38:29,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:38:29,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:38:29,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:38:29,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:38:29,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:38:27" (1/3) ... [2023-11-19 07:38:29,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d85e2f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:38:29, skipping insertion in model container [2023-11-19 07:38:29,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:28" (2/3) ... [2023-11-19 07:38:29,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d85e2f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:38:29, skipping insertion in model container [2023-11-19 07:38:29,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:29" (3/3) ... [2023-11-19 07:38:29,732 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 07:38:29,743 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:38:29,754 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:38:29,754 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 07:38:29,754 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:38:29,820 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:38:29,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 91 transitions, 190 flow [2023-11-19 07:38:29,963 INFO L124 PetriNetUnfolderBase]: 3/89 cut-off events. [2023-11-19 07:38:29,963 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:38:29,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 3/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2023-11-19 07:38:29,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 91 transitions, 190 flow [2023-11-19 07:38:29,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 89 transitions, 184 flow [2023-11-19 07:38:29,982 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:38:30,008 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 89 transitions, 184 flow [2023-11-19 07:38:30,015 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 89 transitions, 184 flow [2023-11-19 07:38:30,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 89 transitions, 184 flow [2023-11-19 07:38:30,059 INFO L124 PetriNetUnfolderBase]: 3/89 cut-off events. [2023-11-19 07:38:30,059 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:38:30,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 3/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2023-11-19 07:38:30,065 INFO L119 LiptonReduction]: Number of co-enabled transitions 1244 [2023-11-19 07:38:33,859 INFO L134 LiptonReduction]: Checked pairs total: 2899 [2023-11-19 07:38:33,859 INFO L136 LiptonReduction]: Total number of compositions: 82 [2023-11-19 07:38:33,874 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:38:33,881 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;@41a82999, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:38:33,881 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-19 07:38:33,884 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:38:33,884 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-19 07:38:33,884 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:38:33,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:38:33,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-19 07:38:33,885 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:38:33,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:33,890 INFO L85 PathProgramCache]: Analyzing trace with hash 412421, now seen corresponding path program 1 times [2023-11-19 07:38:33,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:33,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306567592] [2023-11-19 07:38:33,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:33,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:34,356 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-19 07:38:34,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:34,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306567592] [2023-11-19 07:38:34,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306567592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:34,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:34,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:38:34,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999380437] [2023-11-19 07:38:34,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:34,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:38:34,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:34,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:38:34,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:38:34,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 173 [2023-11-19 07:38:34,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-19 07:38:34,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:38:34,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 173 [2023-11-19 07:38:34,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:38:34,646 INFO L124 PetriNetUnfolderBase]: 159/313 cut-off events. [2023-11-19 07:38:34,647 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-19 07:38:34,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 313 events. 159/313 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1446 event pairs, 18 based on Foata normal form. 16/296 useless extension candidates. Maximal degree in co-relation 597. Up to 232 conditions per place. [2023-11-19 07:38:34,656 INFO L140 encePairwiseOnDemand]: 169/173 looper letters, 21 selfloop transitions, 2 changer transitions 4/29 dead transitions. [2023-11-19 07:38:34,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 121 flow [2023-11-19 07:38:34,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:38:34,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:38:34,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2023-11-19 07:38:34,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5086705202312138 [2023-11-19 07:38:34,687 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 264 transitions. [2023-11-19 07:38:34,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 264 transitions. [2023-11-19 07:38:34,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:38:34,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 264 transitions. [2023-11-19 07:38:34,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.0) internal successors, (264), 3 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-19 07:38:34,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 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-19 07:38:34,719 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 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-19 07:38:34,722 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 264 transitions. [2023-11-19 07:38:34,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 121 flow [2023-11-19 07:38:34,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:38:34,727 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2023-11-19 07:38:34,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-11-19 07:38:34,734 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-11-19 07:38:34,734 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2023-11-19 07:38:34,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-19 07:38:34,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:38:34,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:34,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:38:34,736 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:38:34,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:34,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1808682418, now seen corresponding path program 1 times [2023-11-19 07:38:34,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:34,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107919752] [2023-11-19 07:38:34,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:34,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:35,213 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-19 07:38:35,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:35,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107919752] [2023-11-19 07:38:35,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107919752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:35,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:35,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:38:35,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673740930] [2023-11-19 07:38:35,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:35,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:38:35,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:35,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:38:35,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:38:35,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 173 [2023-11-19 07:38:35,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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-19 07:38:35,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:38:35,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 173 [2023-11-19 07:38:35,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:38:35,413 INFO L124 PetriNetUnfolderBase]: 109/223 cut-off events. [2023-11-19 07:38:35,413 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-19 07:38:35,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 223 events. 109/223 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 886 event pairs, 28 based on Foata normal form. 16/238 useless extension candidates. Maximal degree in co-relation 457. Up to 146 conditions per place. [2023-11-19 07:38:35,418 INFO L140 encePairwiseOnDemand]: 169/173 looper letters, 17 selfloop transitions, 2 changer transitions 10/31 dead transitions. [2023-11-19 07:38:35,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 31 transitions, 134 flow [2023-11-19 07:38:35,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:38:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:38:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 406 transitions. [2023-11-19 07:38:35,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46936416184971097 [2023-11-19 07:38:35,422 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 406 transitions. [2023-11-19 07:38:35,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 406 transitions. [2023-11-19 07:38:35,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:38:35,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 406 transitions. [2023-11-19 07:38:35,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 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-19 07:38:35,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 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-19 07:38:35,435 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 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-19 07:38:35,436 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 5 states and 406 transitions. [2023-11-19 07:38:35,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 31 transitions, 134 flow [2023-11-19 07:38:35,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:38:35,438 INFO L231 Difference]: Finished difference. Result has 28 places, 16 transitions, 48 flow [2023-11-19 07:38:35,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=48, PETRI_PLACES=28, PETRI_TRANSITIONS=16} [2023-11-19 07:38:35,441 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2023-11-19 07:38:35,441 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 16 transitions, 48 flow [2023-11-19 07:38:35,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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-19 07:38:35,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:38:35,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:35,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:38:35,449 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:38:35,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:35,453 INFO L85 PathProgramCache]: Analyzing trace with hash 234589281, now seen corresponding path program 1 times [2023-11-19 07:38:35,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:35,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179615408] [2023-11-19 07:38:35,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:35,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:36,787 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-19 07:38:36,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:36,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179615408] [2023-11-19 07:38:36,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179615408] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:36,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:36,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:38:36,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140653984] [2023-11-19 07:38:36,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:36,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:38:36,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:36,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:38:36,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:38:36,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 173 [2023-11-19 07:38:36,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 16 transitions, 48 flow. Second operand has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 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-19 07:38:36,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:38:36,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 173 [2023-11-19 07:38:36,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:38:37,357 INFO L124 PetriNetUnfolderBase]: 149/279 cut-off events. [2023-11-19 07:38:37,357 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2023-11-19 07:38:37,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 279 events. 149/279 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1160 event pairs, 14 based on Foata normal form. 17/294 useless extension candidates. Maximal degree in co-relation 637. Up to 155 conditions per place. [2023-11-19 07:38:37,360 INFO L140 encePairwiseOnDemand]: 164/173 looper letters, 26 selfloop transitions, 10 changer transitions 15/52 dead transitions. [2023-11-19 07:38:37,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 52 transitions, 242 flow [2023-11-19 07:38:37,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:38:37,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-19 07:38:37,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 676 transitions. [2023-11-19 07:38:37,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4341682723185613 [2023-11-19 07:38:37,365 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 676 transitions. [2023-11-19 07:38:37,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 676 transitions. [2023-11-19 07:38:37,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:38:37,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 676 transitions. [2023-11-19 07:38:37,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 75.11111111111111) internal successors, (676), 9 states have internal predecessors, (676), 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-19 07:38:37,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 173.0) internal successors, (1730), 10 states have internal predecessors, (1730), 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-19 07:38:37,375 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 173.0) internal successors, (1730), 10 states have internal predecessors, (1730), 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-19 07:38:37,375 INFO L175 Difference]: Start difference. First operand has 28 places, 16 transitions, 48 flow. Second operand 9 states and 676 transitions. [2023-11-19 07:38:37,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 52 transitions, 242 flow [2023-11-19 07:38:37,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 52 transitions, 226 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-19 07:38:37,379 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 126 flow [2023-11-19 07:38:37,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=126, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2023-11-19 07:38:37,380 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2023-11-19 07:38:37,381 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 126 flow [2023-11-19 07:38:37,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 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-19 07:38:37,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:38:37,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:37,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:38:37,382 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:38:37,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:37,383 INFO L85 PathProgramCache]: Analyzing trace with hash 233378421, now seen corresponding path program 2 times [2023-11-19 07:38:37,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:37,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828802062] [2023-11-19 07:38:37,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:37,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:38,406 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-19 07:38:38,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:38,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828802062] [2023-11-19 07:38:38,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828802062] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:38,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:38,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:38:38,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266378504] [2023-11-19 07:38:38,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:38,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:38:38,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:38,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:38:38,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:38:38,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 173 [2023-11-19 07:38:38,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 126 flow. Second operand has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 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-19 07:38:38,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:38:38,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 173 [2023-11-19 07:38:38,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:38:38,687 INFO L124 PetriNetUnfolderBase]: 166/318 cut-off events. [2023-11-19 07:38:38,688 INFO L125 PetriNetUnfolderBase]: For 653/656 co-relation queries the response was YES. [2023-11-19 07:38:38,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 318 events. 166/318 cut-off events. For 653/656 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1364 event pairs, 24 based on Foata normal form. 15/332 useless extension candidates. Maximal degree in co-relation 1128. Up to 124 conditions per place. [2023-11-19 07:38:38,691 INFO L140 encePairwiseOnDemand]: 168/173 looper letters, 22 selfloop transitions, 3 changer transitions 21/47 dead transitions. [2023-11-19 07:38:38,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 336 flow [2023-11-19 07:38:38,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:38:38,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:38:38,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 454 transitions. [2023-11-19 07:38:38,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4373795761078998 [2023-11-19 07:38:38,695 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 454 transitions. [2023-11-19 07:38:38,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 454 transitions. [2023-11-19 07:38:38,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:38:38,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 454 transitions. [2023-11-19 07:38:38,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 75.66666666666667) internal successors, (454), 6 states have internal predecessors, (454), 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-19 07:38:38,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 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-19 07:38:38,702 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 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-19 07:38:38,702 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 126 flow. Second operand 6 states and 454 transitions. [2023-11-19 07:38:38,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 336 flow [2023-11-19 07:38:38,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 326 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-19 07:38:38,710 INFO L231 Difference]: Finished difference. Result has 39 places, 18 transitions, 104 flow [2023-11-19 07:38:38,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=18} [2023-11-19 07:38:38,713 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2023-11-19 07:38:38,713 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 18 transitions, 104 flow [2023-11-19 07:38:38,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 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-19 07:38:38,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:38:38,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:38,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:38:38,715 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:38:38,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:38,716 INFO L85 PathProgramCache]: Analyzing trace with hash -101353584, now seen corresponding path program 1 times [2023-11-19 07:38:38,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:38,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247238355] [2023-11-19 07:38:38,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:38,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:39,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:38:39,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:39,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247238355] [2023-11-19 07:38:39,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247238355] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:39,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:39,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:38:39,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802524332] [2023-11-19 07:38:39,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:39,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:38:39,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:39,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:38:39,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:38:39,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 173 [2023-11-19 07:38:39,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 18 transitions, 104 flow. Second operand has 6 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 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-19 07:38:39,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:38:39,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 173 [2023-11-19 07:38:39,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:38:39,521 INFO L124 PetriNetUnfolderBase]: 80/163 cut-off events. [2023-11-19 07:38:39,521 INFO L125 PetriNetUnfolderBase]: For 369/369 co-relation queries the response was YES. [2023-11-19 07:38:39,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 163 events. 80/163 cut-off events. For 369/369 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 475 event pairs, 51 based on Foata normal form. 12/175 useless extension candidates. Maximal degree in co-relation 595. Up to 135 conditions per place. [2023-11-19 07:38:39,523 INFO L140 encePairwiseOnDemand]: 165/173 looper letters, 20 selfloop transitions, 6 changer transitions 7/34 dead transitions. [2023-11-19 07:38:39,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 258 flow [2023-11-19 07:38:39,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:38:39,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:38:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 527 transitions. [2023-11-19 07:38:39,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.435177539223782 [2023-11-19 07:38:39,527 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 527 transitions. [2023-11-19 07:38:39,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 527 transitions. [2023-11-19 07:38:39,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:38:39,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 527 transitions. [2023-11-19 07:38:39,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 75.28571428571429) internal successors, (527), 7 states have internal predecessors, (527), 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-19 07:38:39,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 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-19 07:38:39,534 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 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-19 07:38:39,534 INFO L175 Difference]: Start difference. First operand has 39 places, 18 transitions, 104 flow. Second operand 7 states and 527 transitions. [2023-11-19 07:38:39,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 258 flow [2023-11-19 07:38:39,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 216 flow, removed 13 selfloop flow, removed 10 redundant places. [2023-11-19 07:38:39,538 INFO L231 Difference]: Finished difference. Result has 37 places, 20 transitions, 124 flow [2023-11-19 07:38:39,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=124, PETRI_PLACES=37, PETRI_TRANSITIONS=20} [2023-11-19 07:38:39,540 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2023-11-19 07:38:39,540 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 20 transitions, 124 flow [2023-11-19 07:38:39,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 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-19 07:38:39,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:38:39,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:39,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:38:39,541 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:38:39,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:39,542 INFO L85 PathProgramCache]: Analyzing trace with hash 501025150, now seen corresponding path program 1 times [2023-11-19 07:38:39,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:39,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568129235] [2023-11-19 07:38:39,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:39,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:40,052 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-19 07:38:40,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:40,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568129235] [2023-11-19 07:38:40,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568129235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:40,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:40,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:38:40,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382609507] [2023-11-19 07:38:40,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:40,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:38:40,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:40,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:38:40,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:38:40,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 173 [2023-11-19 07:38:40,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 20 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 73.2) internal successors, (366), 5 states have internal predecessors, (366), 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-19 07:38:40,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:38:40,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 173 [2023-11-19 07:38:40,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:38:40,193 INFO L124 PetriNetUnfolderBase]: 36/90 cut-off events. [2023-11-19 07:38:40,193 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2023-11-19 07:38:40,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 90 events. 36/90 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 220 event pairs, 4 based on Foata normal form. 6/96 useless extension candidates. Maximal degree in co-relation 349. Up to 65 conditions per place. [2023-11-19 07:38:40,196 INFO L140 encePairwiseOnDemand]: 166/173 looper letters, 26 selfloop transitions, 6 changer transitions 0/33 dead transitions. [2023-11-19 07:38:40,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 242 flow [2023-11-19 07:38:40,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:38:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:38:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2023-11-19 07:38:40,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.446242774566474 [2023-11-19 07:38:40,199 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 386 transitions. [2023-11-19 07:38:40,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 386 transitions. [2023-11-19 07:38:40,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:38:40,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 386 transitions. [2023-11-19 07:38:40,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 77.2) internal successors, (386), 5 states have internal predecessors, (386), 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-19 07:38:40,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 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-19 07:38:40,205 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 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-19 07:38:40,205 INFO L175 Difference]: Start difference. First operand has 37 places, 20 transitions, 124 flow. Second operand 5 states and 386 transitions. [2023-11-19 07:38:40,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 242 flow [2023-11-19 07:38:40,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 33 transitions, 218 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-11-19 07:38:40,209 INFO L231 Difference]: Finished difference. Result has 37 places, 22 transitions, 128 flow [2023-11-19 07:38:40,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2023-11-19 07:38:40,212 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2023-11-19 07:38:40,213 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 128 flow [2023-11-19 07:38:40,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.2) internal successors, (366), 5 states have internal predecessors, (366), 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-19 07:38:40,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:38:40,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:40,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:38:40,214 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:38:40,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:40,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1661505533, now seen corresponding path program 1 times [2023-11-19 07:38:40,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:40,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474841447] [2023-11-19 07:38:40,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:40,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:40,494 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-19 07:38:40,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:40,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474841447] [2023-11-19 07:38:40,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474841447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:40,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:40,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:38:40,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140900299] [2023-11-19 07:38:40,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:40,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:38:40,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:40,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:38:40,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:38:40,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 173 [2023-11-19 07:38:40,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 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-19 07:38:40,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:38:40,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 173 [2023-11-19 07:38:40,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:38:40,580 INFO L124 PetriNetUnfolderBase]: 13/42 cut-off events. [2023-11-19 07:38:40,581 INFO L125 PetriNetUnfolderBase]: For 98/99 co-relation queries the response was YES. [2023-11-19 07:38:40,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 42 events. 13/42 cut-off events. For 98/99 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 5 based on Foata normal form. 7/48 useless extension candidates. Maximal degree in co-relation 161. Up to 21 conditions per place. [2023-11-19 07:38:40,582 INFO L140 encePairwiseOnDemand]: 169/173 looper letters, 19 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2023-11-19 07:38:40,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 27 transitions, 204 flow [2023-11-19 07:38:40,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:38:40,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:38:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 326 transitions. [2023-11-19 07:38:40,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47109826589595377 [2023-11-19 07:38:40,585 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 326 transitions. [2023-11-19 07:38:40,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 326 transitions. [2023-11-19 07:38:40,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:38:40,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 326 transitions. [2023-11-19 07:38:40,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 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-19 07:38:40,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 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-19 07:38:40,591 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 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-19 07:38:40,591 INFO L175 Difference]: Start difference. First operand has 37 places, 22 transitions, 128 flow. Second operand 4 states and 326 transitions. [2023-11-19 07:38:40,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 27 transitions, 204 flow [2023-11-19 07:38:40,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 27 transitions, 157 flow, removed 17 selfloop flow, removed 7 redundant places. [2023-11-19 07:38:40,594 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 108 flow [2023-11-19 07:38:40,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-11-19 07:38:40,595 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 8 predicate places. [2023-11-19 07:38:40,595 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 108 flow [2023-11-19 07:38:40,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 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-19 07:38:40,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:38:40,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:40,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:38:40,597 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:38:40,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:40,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1904328805, now seen corresponding path program 1 times [2023-11-19 07:38:40,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:40,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829138125] [2023-11-19 07:38:40,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:40,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:42,137 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-19 07:38:42,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:42,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829138125] [2023-11-19 07:38:42,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829138125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:42,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:42,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:38:42,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254839073] [2023-11-19 07:38:42,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:42,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:38:42,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:42,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:38:42,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:38:42,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 173 [2023-11-19 07:38:42,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 108 flow. Second operand has 9 states, 9 states have (on average 73.66666666666667) internal successors, (663), 9 states have internal predecessors, (663), 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-19 07:38:42,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:38:42,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 173 [2023-11-19 07:38:42,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:38:42,425 INFO L124 PetriNetUnfolderBase]: 15/56 cut-off events. [2023-11-19 07:38:42,425 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-11-19 07:38:42,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 56 events. 15/56 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 109 event pairs, 5 based on Foata normal form. 1/57 useless extension candidates. Maximal degree in co-relation 191. Up to 32 conditions per place. [2023-11-19 07:38:42,426 INFO L140 encePairwiseOnDemand]: 167/173 looper letters, 18 selfloop transitions, 4 changer transitions 11/34 dead transitions. [2023-11-19 07:38:42,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 236 flow [2023-11-19 07:38:42,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:38:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:38:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 460 transitions. [2023-11-19 07:38:42,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44315992292870904 [2023-11-19 07:38:42,431 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 460 transitions. [2023-11-19 07:38:42,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 460 transitions. [2023-11-19 07:38:42,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:38:42,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 460 transitions. [2023-11-19 07:38:42,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 states have internal predecessors, (460), 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-19 07:38:42,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 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-19 07:38:42,438 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 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-19 07:38:42,438 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 108 flow. Second operand 6 states and 460 transitions. [2023-11-19 07:38:42,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 236 flow [2023-11-19 07:38:42,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 217 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-19 07:38:42,441 INFO L231 Difference]: Finished difference. Result has 39 places, 20 transitions, 99 flow [2023-11-19 07:38:42,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=99, PETRI_PLACES=39, PETRI_TRANSITIONS=20} [2023-11-19 07:38:42,442 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2023-11-19 07:38:42,442 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 20 transitions, 99 flow [2023-11-19 07:38:42,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 73.66666666666667) internal successors, (663), 9 states have internal predecessors, (663), 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-19 07:38:42,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:38:42,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:42,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:38:42,444 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:38:42,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:42,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1418059557, now seen corresponding path program 2 times [2023-11-19 07:38:42,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:42,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506737718] [2023-11-19 07:38:42,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:42,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:38:42,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:38:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:38:42,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:38:42,615 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:38:42,617 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-19 07:38:42,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-19 07:38:42,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-19 07:38:42,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-19 07:38:42,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-19 07:38:42,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:38:42,625 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2023-11-19 07:38:42,632 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:38:42,633 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:38:42,692 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 07:38:42,695 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:38:42,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:38:42 BasicIcfg [2023-11-19 07:38:42,735 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:38:42,736 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:38:42,736 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:38:42,736 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:38:42,737 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:29" (3/4) ... [2023-11-19 07:38:42,739 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 07:38:42,771 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 07:38:42,772 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:38:42,855 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a6899d3-a00d-4ffd-a393-bfda9827da86/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:38:42,855 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:38:42,856 INFO L158 Benchmark]: Toolchain (without parser) took 15051.40ms. Allocated memory was 127.9MB in the beginning and 272.6MB in the end (delta: 144.7MB). Free memory was 82.2MB in the beginning and 238.1MB in the end (delta: -156.0MB). Peak memory consumption was 148.3MB. Max. memory is 16.1GB. [2023-11-19 07:38:42,856 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 127.9MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:38:42,857 INFO L158 Benchmark]: CACSL2BoogieTranslator took 770.98ms. Allocated memory is still 127.9MB. Free memory was 82.0MB in the beginning and 59.3MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 07:38:42,857 INFO L158 Benchmark]: Boogie Procedure Inliner took 117.42ms. Allocated memory is still 127.9MB. Free memory was 59.3MB in the beginning and 56.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:38:42,858 INFO L158 Benchmark]: Boogie Preprocessor took 76.14ms. Allocated memory is still 127.9MB. Free memory was 56.6MB in the beginning and 54.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:38:42,858 INFO L158 Benchmark]: RCFGBuilder took 946.84ms. Allocated memory was 127.9MB in the beginning and 188.7MB in the end (delta: 60.8MB). Free memory was 54.7MB in the beginning and 138.3MB in the end (delta: -83.6MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2023-11-19 07:38:42,859 INFO L158 Benchmark]: TraceAbstraction took 13012.99ms. Allocated memory was 188.7MB in the beginning and 272.6MB in the end (delta: 83.9MB). Free memory was 137.2MB in the beginning and 86.2MB in the end (delta: 51.1MB). Peak memory consumption was 133.9MB. Max. memory is 16.1GB. [2023-11-19 07:38:42,859 INFO L158 Benchmark]: Witness Printer took 119.15ms. Allocated memory is still 272.6MB. Free memory was 86.2MB in the beginning and 238.1MB in the end (delta: -152.0MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2023-11-19 07:38:42,861 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.33ms. Allocated memory is still 127.9MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 770.98ms. Allocated memory is still 127.9MB. Free memory was 82.0MB in the beginning and 59.3MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 117.42ms. Allocated memory is still 127.9MB. Free memory was 59.3MB in the beginning and 56.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.14ms. Allocated memory is still 127.9MB. Free memory was 56.6MB in the beginning and 54.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 946.84ms. Allocated memory was 127.9MB in the beginning and 188.7MB in the end (delta: 60.8MB). Free memory was 54.7MB in the beginning and 138.3MB in the end (delta: -83.6MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13012.99ms. Allocated memory was 188.7MB in the beginning and 272.6MB in the end (delta: 83.9MB). Free memory was 137.2MB in the beginning and 86.2MB in the end (delta: 51.1MB). Peak memory consumption was 133.9MB. Max. memory is 16.1GB. * Witness Printer took 119.15ms. Allocated memory is still 272.6MB. Free memory was 86.2MB in the beginning and 238.1MB in the end (delta: -152.0MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 93 PlacesBefore, 26 PlacesAfterwards, 89 TransitionsBefore, 20 TransitionsAfterwards, 1244 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 82 TotalNumberOfCompositions, 2899 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1478, independent: 1354, independent conditional: 0, independent unconditional: 1354, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 651, independent: 629, independent conditional: 0, independent unconditional: 629, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1478, independent: 725, independent conditional: 0, independent unconditional: 725, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 651, unknown conditional: 0, unknown unconditional: 651] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 45, Positive conditional cache size: 0, Positive unconditional cache size: 45, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2009; [L793] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009={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] [L794] 0 pthread_t t2010; [L795] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2009={5:0}, t2010={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] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L764] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L770] 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) [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 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 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 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=1, __unbuffered_p1_EAX=1, 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=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, 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=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 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) [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] 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 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009={5:0}, t2010={3: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=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 795]: 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, 108 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: 12.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 298 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 231 mSDsluCounter, 257 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 204 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 683 IncrementalHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 53 mSDtfsCounter, 683 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=6, InterpolantAutomatonStates: 45, 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, 5.7s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 773 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-19 07:38:42,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a6899d3-a00d-4ffd-a393-bfda9827da86/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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