./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.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_4c011191-aff9-4b89-b2b8-f3359744fefc/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c011191-aff9-4b89-b2b8-f3359744fefc/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_4c011191-aff9-4b89-b2b8-f3359744fefc/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c011191-aff9-4b89-b2b8-f3359744fefc/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c011191-aff9-4b89-b2b8-f3359744fefc/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_4c011191-aff9-4b89-b2b8-f3359744fefc/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 40cdaf120a3550cc54773a608bdbc3a68dee1334013ab0b4984b9366bf820a3d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:50:49,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:50:49,891 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c011191-aff9-4b89-b2b8-f3359744fefc/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:50:49,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:50:49,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:50:49,923 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:50:49,924 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:50:49,924 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:50:49,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:50:49,926 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:50:49,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:50:49,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:50:49,928 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:50:49,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:50:49,929 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:50:49,929 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:50:49,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:50:49,931 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:50:49,931 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:50:49,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:50:49,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:50:49,933 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:50:49,933 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:50:49,934 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:50:49,934 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:50:49,935 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:50:49,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:50:49,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:50:49,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:50:49,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:50:49,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:50:49,938 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:50:49,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:50:49,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:50:49,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:50:49,940 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:50:49,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:50:49,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:50:49,941 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:50:49,941 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_4c011191-aff9-4b89-b2b8-f3359744fefc/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_4c011191-aff9-4b89-b2b8-f3359744fefc/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 -> 40cdaf120a3550cc54773a608bdbc3a68dee1334013ab0b4984b9366bf820a3d [2023-11-19 07:50:50,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:50:50,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:50:50,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:50:50,278 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:50:50,279 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:50:50,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c011191-aff9-4b89-b2b8-f3359744fefc/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 07:50:53,402 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:50:53,765 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:50:53,765 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c011191-aff9-4b89-b2b8-f3359744fefc/sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 07:50:53,790 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c011191-aff9-4b89-b2b8-f3359744fefc/bin/uautomizer-verify-uCwYo4JHxu/data/0110d68aa/85ddead69ce944d28a5ea16603d94221/FLAGef5e3699c [2023-11-19 07:50:53,809 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c011191-aff9-4b89-b2b8-f3359744fefc/bin/uautomizer-verify-uCwYo4JHxu/data/0110d68aa/85ddead69ce944d28a5ea16603d94221 [2023-11-19 07:50:53,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:50:53,817 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:50:53,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:50:53,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:50:53,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:50:53,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:50:53" (1/1) ... [2023-11-19 07:50:53,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7092a7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:53, skipping insertion in model container [2023-11-19 07:50:53,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:50:53" (1/1) ... [2023-11-19 07:50:53,877 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:50:54,061 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_4c011191-aff9-4b89-b2b8-f3359744fefc/sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-19 07:50:54,331 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:50:54,347 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:50:54,361 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_4c011191-aff9-4b89-b2b8-f3359744fefc/sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-19 07:50:54,412 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:50:54,448 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:50:54,448 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:50:54,457 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:50:54,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:54 WrapperNode [2023-11-19 07:50:54,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:50:54,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:50:54,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:50:54,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:50:54,467 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:50:54" (1/1) ... [2023-11-19 07:50:54,486 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:50:54" (1/1) ... [2023-11-19 07:50:54,515 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2023-11-19 07:50:54,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:50:54,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:50:54,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:50:54,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:50:54,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:54" (1/1) ... [2023-11-19 07:50:54,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:54" (1/1) ... [2023-11-19 07:50:54,533 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:54" (1/1) ... [2023-11-19 07:50:54,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:54" (1/1) ... [2023-11-19 07:50:54,557 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:54" (1/1) ... [2023-11-19 07:50:54,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:54" (1/1) ... [2023-11-19 07:50:54,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:54" (1/1) ... [2023-11-19 07:50:54,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:54" (1/1) ... [2023-11-19 07:50:54,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:50:54,580 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:50:54,581 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:50:54,581 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:50:54,582 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:54" (1/1) ... [2023-11-19 07:50:54,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:50:54,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c011191-aff9-4b89-b2b8-f3359744fefc/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:54,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c011191-aff9-4b89-b2b8-f3359744fefc/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:50:54,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c011191-aff9-4b89-b2b8-f3359744fefc/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:50:54,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:50:54,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:50:54,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:50:54,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:50:54,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:50:54,672 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:50:54,672 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:50:54,673 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:50:54,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:50:54,673 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:50:54,675 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:50:54,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:50:54,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:50:54,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:50:54,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:50:54,678 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:50:54,886 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:50:54,890 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:50:55,349 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:50:55,566 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:50:55,567 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:50:55,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:50:55 BoogieIcfgContainer [2023-11-19 07:50:55,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:50:55,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:50:55,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:50:55,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:50:55,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:50:53" (1/3) ... [2023-11-19 07:50:55,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b982e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:50:55, skipping insertion in model container [2023-11-19 07:50:55,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:54" (2/3) ... [2023-11-19 07:50:55,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b982e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:50:55, skipping insertion in model container [2023-11-19 07:50:55,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:50:55" (3/3) ... [2023-11-19 07:50:55,581 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 07:50:55,591 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:50:55,603 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:50:55,603 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 07:50:55,603 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:50:55,666 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:50:55,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 111 transitions, 234 flow [2023-11-19 07:50:55,770 INFO L124 PetriNetUnfolderBase]: 3/108 cut-off events. [2023-11-19 07:50:55,771 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:50:55,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 3/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2023-11-19 07:50:55,778 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 111 transitions, 234 flow [2023-11-19 07:50:55,783 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 108 transitions, 225 flow [2023-11-19 07:50:55,787 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:50:55,798 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 108 transitions, 225 flow [2023-11-19 07:50:55,802 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 108 transitions, 225 flow [2023-11-19 07:50:55,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 108 transitions, 225 flow [2023-11-19 07:50:55,835 INFO L124 PetriNetUnfolderBase]: 3/108 cut-off events. [2023-11-19 07:50:55,835 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:50:55,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 3/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2023-11-19 07:50:55,840 INFO L119 LiptonReduction]: Number of co-enabled transitions 2218 [2023-11-19 07:50:59,802 INFO L134 LiptonReduction]: Checked pairs total: 4996 [2023-11-19 07:50:59,803 INFO L136 LiptonReduction]: Total number of compositions: 98 [2023-11-19 07:50:59,819 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:50:59,826 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;@51bf3f11, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:50:59,826 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-19 07:50:59,829 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:50:59,830 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-19 07:50:59,830 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:50:59,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:50:59,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-19 07:50:59,831 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:50:59,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:59,837 INFO L85 PathProgramCache]: Analyzing trace with hash 483384, now seen corresponding path program 1 times [2023-11-19 07:50:59,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:59,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176710772] [2023-11-19 07:50:59,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:59,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:00,324 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:51:00,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:00,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176710772] [2023-11-19 07:51:00,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176710772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:00,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:00,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:51:00,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991320934] [2023-11-19 07:51:00,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:00,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:51:00,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:00,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:51:00,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:51:00,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 209 [2023-11-19 07:51:00,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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:51:00,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:00,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 209 [2023-11-19 07:51:00,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:00,821 INFO L124 PetriNetUnfolderBase]: 895/1447 cut-off events. [2023-11-19 07:51:00,822 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-19 07:51:00,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2830 conditions, 1447 events. 895/1447 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7523 event pairs, 142 based on Foata normal form. 0/1366 useless extension candidates. Maximal degree in co-relation 2819. Up to 1084 conditions per place. [2023-11-19 07:51:00,844 INFO L140 encePairwiseOnDemand]: 205/209 looper letters, 31 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-11-19 07:51:00,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 159 flow [2023-11-19 07:51:00,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:51:00,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:51:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2023-11-19 07:51:00,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5199362041467305 [2023-11-19 07:51:00,869 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 326 transitions. [2023-11-19 07:51:00,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 326 transitions. [2023-11-19 07:51:00,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:00,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 326 transitions. [2023-11-19 07:51:00,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 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:51:00,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:51:00,889 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:51:00,890 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 326 transitions. [2023-11-19 07:51:00,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 159 flow [2023-11-19 07:51:00,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 07:51:00,896 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-11-19 07:51:00,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-11-19 07:51:00,902 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-11-19 07:51:00,903 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-11-19 07:51:00,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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:51:00,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:00,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:00,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:51:00,905 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:51:00,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:00,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2126401467, now seen corresponding path program 1 times [2023-11-19 07:51:00,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:00,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368372162] [2023-11-19 07:51:00,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:00,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:01,186 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:51:01,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:01,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368372162] [2023-11-19 07:51:01,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368372162] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:01,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:01,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:51:01,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949311872] [2023-11-19 07:51:01,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:01,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:51:01,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:01,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:51:01,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:51:01,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 209 [2023-11-19 07:51:01,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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:51:01,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:01,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 209 [2023-11-19 07:51:01,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:01,723 INFO L124 PetriNetUnfolderBase]: 1767/2677 cut-off events. [2023-11-19 07:51:01,723 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2023-11-19 07:51:01,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5585 conditions, 2677 events. 1767/2677 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 12862 event pairs, 623 based on Foata normal form. 107/2784 useless extension candidates. Maximal degree in co-relation 5575. Up to 1388 conditions per place. [2023-11-19 07:51:01,742 INFO L140 encePairwiseOnDemand]: 202/209 looper letters, 31 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2023-11-19 07:51:01,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 162 flow [2023-11-19 07:51:01,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:51:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:51:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2023-11-19 07:51:01,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49122807017543857 [2023-11-19 07:51:01,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions. [2023-11-19 07:51:01,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions. [2023-11-19 07:51:01,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:01,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions. [2023-11-19 07:51:01,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 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:51:01,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:51:01,758 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:51:01,758 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 308 transitions. [2023-11-19 07:51:01,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 162 flow [2023-11-19 07:51:01,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 37 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:51:01,762 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 94 flow [2023-11-19 07:51:01,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2023-11-19 07:51:01,764 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2023-11-19 07:51:01,770 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 94 flow [2023-11-19 07:51:01,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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:51:01,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:01,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:01,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:51:01,772 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:51:01,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:01,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1493937642, now seen corresponding path program 1 times [2023-11-19 07:51:01,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:01,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003108371] [2023-11-19 07:51:01,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:01,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:02,070 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:51:02,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:02,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003108371] [2023-11-19 07:51:02,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003108371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:02,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:02,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:51:02,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822915702] [2023-11-19 07:51:02,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:02,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:51:02,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:02,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:51:02,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:51:02,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 209 [2023-11-19 07:51:02,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 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:51:02,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:02,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 209 [2023-11-19 07:51:02,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:02,579 INFO L124 PetriNetUnfolderBase]: 1726/2613 cut-off events. [2023-11-19 07:51:02,579 INFO L125 PetriNetUnfolderBase]: For 1017/1017 co-relation queries the response was YES. [2023-11-19 07:51:02,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6560 conditions, 2613 events. 1726/2613 cut-off events. For 1017/1017 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12441 event pairs, 146 based on Foata normal form. 5/2618 useless extension candidates. Maximal degree in co-relation 6548. Up to 1297 conditions per place. [2023-11-19 07:51:02,599 INFO L140 encePairwiseOnDemand]: 202/209 looper letters, 38 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2023-11-19 07:51:02,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 48 transitions, 256 flow [2023-11-19 07:51:02,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:51:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:51:02,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2023-11-19 07:51:02,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48564593301435405 [2023-11-19 07:51:02,602 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 406 transitions. [2023-11-19 07:51:02,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 406 transitions. [2023-11-19 07:51:02,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:02,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 406 transitions. [2023-11-19 07:51:02,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.5) internal successors, (406), 4 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:51:02,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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:51:02,607 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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:51:02,608 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 94 flow. Second operand 4 states and 406 transitions. [2023-11-19 07:51:02,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 48 transitions, 256 flow [2023-11-19 07:51:02,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 48 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:51:02,614 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 150 flow [2023-11-19 07:51:02,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2023-11-19 07:51:02,616 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2023-11-19 07:51:02,616 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 150 flow [2023-11-19 07:51:02,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 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:51:02,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:02,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:02,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:51:02,617 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:51:02,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:02,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1493936619, now seen corresponding path program 1 times [2023-11-19 07:51:02,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:02,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107444185] [2023-11-19 07:51:02,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:02,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:02,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:02,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:02,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107444185] [2023-11-19 07:51:02,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107444185] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:02,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:02,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:51:02,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603234144] [2023-11-19 07:51:02,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:02,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:51:02,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:02,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:51:02,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:51:02,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 209 [2023-11-19 07:51:02,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 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:51:02,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:02,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 209 [2023-11-19 07:51:02,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:03,374 INFO L124 PetriNetUnfolderBase]: 1687/2554 cut-off events. [2023-11-19 07:51:03,375 INFO L125 PetriNetUnfolderBase]: For 1977/1977 co-relation queries the response was YES. [2023-11-19 07:51:03,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6956 conditions, 2554 events. 1687/2554 cut-off events. For 1977/1977 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12076 event pairs, 229 based on Foata normal form. 8/2562 useless extension candidates. Maximal degree in co-relation 6941. Up to 1264 conditions per place. [2023-11-19 07:51:03,396 INFO L140 encePairwiseOnDemand]: 202/209 looper letters, 43 selfloop transitions, 14 changer transitions 0/57 dead transitions. [2023-11-19 07:51:03,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 57 transitions, 344 flow [2023-11-19 07:51:03,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:51:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:51:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 411 transitions. [2023-11-19 07:51:03,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4916267942583732 [2023-11-19 07:51:03,400 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 411 transitions. [2023-11-19 07:51:03,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 411 transitions. [2023-11-19 07:51:03,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:03,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 411 transitions. [2023-11-19 07:51:03,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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:51:03,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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:51:03,405 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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:51:03,406 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 150 flow. Second operand 4 states and 411 transitions. [2023-11-19 07:51:03,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 57 transitions, 344 flow [2023-11-19 07:51:03,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 57 transitions, 344 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:51:03,415 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 232 flow [2023-11-19 07:51:03,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2023-11-19 07:51:03,417 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2023-11-19 07:51:03,417 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 232 flow [2023-11-19 07:51:03,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 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:51:03,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:03,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:03,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:51:03,419 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:51:03,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:03,420 INFO L85 PathProgramCache]: Analyzing trace with hash 932572772, now seen corresponding path program 1 times [2023-11-19 07:51:03,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:03,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615766545] [2023-11-19 07:51:03,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:03,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:03,579 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:51:03,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:03,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615766545] [2023-11-19 07:51:03,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615766545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:03,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:03,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:51:03,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967212566] [2023-11-19 07:51:03,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:03,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:51:03,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:03,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:51:03,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:51:03,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 209 [2023-11-19 07:51:03,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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:51:03,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:03,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 209 [2023-11-19 07:51:03,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:03,916 INFO L124 PetriNetUnfolderBase]: 704/1236 cut-off events. [2023-11-19 07:51:03,916 INFO L125 PetriNetUnfolderBase]: For 1679/1713 co-relation queries the response was YES. [2023-11-19 07:51:03,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3604 conditions, 1236 events. 704/1236 cut-off events. For 1679/1713 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6208 event pairs, 155 based on Foata normal form. 99/1328 useless extension candidates. Maximal degree in co-relation 3585. Up to 958 conditions per place. [2023-11-19 07:51:03,932 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 43 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2023-11-19 07:51:03,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 430 flow [2023-11-19 07:51:03,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:51:03,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:51:03,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2023-11-19 07:51:03,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49920255183413076 [2023-11-19 07:51:03,935 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2023-11-19 07:51:03,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2023-11-19 07:51:03,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:03,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2023-11-19 07:51:03,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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:51:03,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:51:03,941 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:51:03,941 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 232 flow. Second operand 3 states and 313 transitions. [2023-11-19 07:51:03,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 430 flow [2023-11-19 07:51:03,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 428 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-19 07:51:03,949 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 256 flow [2023-11-19 07:51:03,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2023-11-19 07:51:03,951 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2023-11-19 07:51:03,951 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 256 flow [2023-11-19 07:51:03,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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:51:03,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:03,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:03,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:51:03,952 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:51:03,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:03,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1527164927, now seen corresponding path program 1 times [2023-11-19 07:51:03,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:03,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590929214] [2023-11-19 07:51:03,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:03,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:04,161 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:51:04,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:04,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590929214] [2023-11-19 07:51:04,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590929214] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:04,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:04,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:51:04,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664864799] [2023-11-19 07:51:04,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:04,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:51:04,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:04,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:51:04,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:51:04,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 209 [2023-11-19 07:51:04,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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:51:04,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:04,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 209 [2023-11-19 07:51:04,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:04,630 INFO L124 PetriNetUnfolderBase]: 1080/1876 cut-off events. [2023-11-19 07:51:04,630 INFO L125 PetriNetUnfolderBase]: For 2938/2950 co-relation queries the response was YES. [2023-11-19 07:51:04,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6130 conditions, 1876 events. 1080/1876 cut-off events. For 2938/2950 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10184 event pairs, 456 based on Foata normal form. 46/1916 useless extension candidates. Maximal degree in co-relation 6108. Up to 1005 conditions per place. [2023-11-19 07:51:04,646 INFO L140 encePairwiseOnDemand]: 206/209 looper letters, 43 selfloop transitions, 7 changer transitions 4/57 dead transitions. [2023-11-19 07:51:04,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 439 flow [2023-11-19 07:51:04,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:51:04,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:51:04,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2023-11-19 07:51:04,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.507177033492823 [2023-11-19 07:51:04,649 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2023-11-19 07:51:04,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2023-11-19 07:51:04,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:04,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2023-11-19 07:51:04,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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:51:04,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:51:04,654 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:51:04,654 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 256 flow. Second operand 3 states and 318 transitions. [2023-11-19 07:51:04,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 439 flow [2023-11-19 07:51:04,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 432 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:51:04,664 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 258 flow [2023-11-19 07:51:04,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2023-11-19 07:51:04,665 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2023-11-19 07:51:04,666 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 258 flow [2023-11-19 07:51:04,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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:51:04,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:04,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:04,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:51:04,667 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:51:04,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:04,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1735474650, now seen corresponding path program 1 times [2023-11-19 07:51:04,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:04,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330171190] [2023-11-19 07:51:04,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:04,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:04,858 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:51:04,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:04,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330171190] [2023-11-19 07:51:04,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330171190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:04,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:04,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:51:04,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659014291] [2023-11-19 07:51:04,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:04,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:51:04,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:04,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:51:04,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:51:04,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 209 [2023-11-19 07:51:04,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 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:51:04,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:04,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 209 [2023-11-19 07:51:04,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:05,195 INFO L124 PetriNetUnfolderBase]: 468/903 cut-off events. [2023-11-19 07:51:05,195 INFO L125 PetriNetUnfolderBase]: For 1342/1365 co-relation queries the response was YES. [2023-11-19 07:51:05,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2966 conditions, 903 events. 468/903 cut-off events. For 1342/1365 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4713 event pairs, 119 based on Foata normal form. 117/1007 useless extension candidates. Maximal degree in co-relation 2943. Up to 299 conditions per place. [2023-11-19 07:51:05,206 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 54 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2023-11-19 07:51:05,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 562 flow [2023-11-19 07:51:05,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:51:05,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:51:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 418 transitions. [2023-11-19 07:51:05,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-19 07:51:05,210 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 418 transitions. [2023-11-19 07:51:05,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 418 transitions. [2023-11-19 07:51:05,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:05,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 418 transitions. [2023-11-19 07:51:05,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 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:51:05,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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:51:05,216 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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:51:05,216 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 258 flow. Second operand 4 states and 418 transitions. [2023-11-19 07:51:05,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 562 flow [2023-11-19 07:51:05,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 526 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-19 07:51:05,227 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 279 flow [2023-11-19 07:51:05,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-11-19 07:51:05,229 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 15 predicate places. [2023-11-19 07:51:05,230 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 279 flow [2023-11-19 07:51:05,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 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:51:05,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:05,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:05,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:51:05,231 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:51:05,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:05,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1599923813, now seen corresponding path program 1 times [2023-11-19 07:51:05,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:05,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595029542] [2023-11-19 07:51:05,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:05,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:05,587 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:51:05,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:05,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595029542] [2023-11-19 07:51:05,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595029542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:05,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:05,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:51:05,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27348293] [2023-11-19 07:51:05,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:05,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:51:05,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:05,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:51:05,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:51:05,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 209 [2023-11-19 07:51:05,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 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:51:05,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:05,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 209 [2023-11-19 07:51:05,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:05,840 INFO L124 PetriNetUnfolderBase]: 392/737 cut-off events. [2023-11-19 07:51:05,840 INFO L125 PetriNetUnfolderBase]: For 1308/1331 co-relation queries the response was YES. [2023-11-19 07:51:05,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2702 conditions, 737 events. 392/737 cut-off events. For 1308/1331 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3704 event pairs, 110 based on Foata normal form. 46/770 useless extension candidates. Maximal degree in co-relation 2678. Up to 299 conditions per place. [2023-11-19 07:51:05,846 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 44 selfloop transitions, 10 changer transitions 10/68 dead transitions. [2023-11-19 07:51:05,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 68 transitions, 554 flow [2023-11-19 07:51:05,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:51:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:51:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 511 transitions. [2023-11-19 07:51:05,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48899521531100476 [2023-11-19 07:51:05,850 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 511 transitions. [2023-11-19 07:51:05,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 511 transitions. [2023-11-19 07:51:05,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:05,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 511 transitions. [2023-11-19 07:51:05,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 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:51:05,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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:51:05,857 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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:51:05,857 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 279 flow. Second operand 5 states and 511 transitions. [2023-11-19 07:51:05,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 68 transitions, 554 flow [2023-11-19 07:51:05,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 68 transitions, 536 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-19 07:51:05,864 INFO L231 Difference]: Finished difference. Result has 51 places, 35 transitions, 249 flow [2023-11-19 07:51:05,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2023-11-19 07:51:05,865 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2023-11-19 07:51:05,866 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 249 flow [2023-11-19 07:51:05,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 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:51:05,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:05,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:05,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:51:05,867 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:51:05,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:05,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1312708405, now seen corresponding path program 1 times [2023-11-19 07:51:05,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:05,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005981814] [2023-11-19 07:51:05,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:05,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:06,882 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:51:06,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:06,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005981814] [2023-11-19 07:51:06,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005981814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:06,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:06,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:51:06,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76521431] [2023-11-19 07:51:06,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:06,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:51:06,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:06,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:51:06,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:51:06,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 209 [2023-11-19 07:51:06,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 249 flow. Second operand has 7 states, 7 states have (on average 93.71428571428571) internal successors, (656), 7 states have internal predecessors, (656), 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:51:06,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:06,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 209 [2023-11-19 07:51:06,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:07,282 INFO L124 PetriNetUnfolderBase]: 221/436 cut-off events. [2023-11-19 07:51:07,283 INFO L125 PetriNetUnfolderBase]: For 974/976 co-relation queries the response was YES. [2023-11-19 07:51:07,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1701 conditions, 436 events. 221/436 cut-off events. For 974/976 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1968 event pairs, 16 based on Foata normal form. 3/438 useless extension candidates. Maximal degree in co-relation 1676. Up to 222 conditions per place. [2023-11-19 07:51:07,286 INFO L140 encePairwiseOnDemand]: 203/209 looper letters, 38 selfloop transitions, 4 changer transitions 29/75 dead transitions. [2023-11-19 07:51:07,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 75 transitions, 634 flow [2023-11-19 07:51:07,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:51:07,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:51:07,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 684 transitions. [2023-11-19 07:51:07,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2023-11-19 07:51:07,291 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 684 transitions. [2023-11-19 07:51:07,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 684 transitions. [2023-11-19 07:51:07,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:07,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 684 transitions. [2023-11-19 07:51:07,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 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:51:07,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 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:51:07,298 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 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:51:07,299 INFO L175 Difference]: Start difference. First operand has 51 places, 35 transitions, 249 flow. Second operand 7 states and 684 transitions. [2023-11-19 07:51:07,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 75 transitions, 634 flow [2023-11-19 07:51:07,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 75 transitions, 538 flow, removed 13 selfloop flow, removed 8 redundant places. [2023-11-19 07:51:07,305 INFO L231 Difference]: Finished difference. Result has 51 places, 35 transitions, 213 flow [2023-11-19 07:51:07,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=213, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2023-11-19 07:51:07,307 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2023-11-19 07:51:07,307 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 213 flow [2023-11-19 07:51:07,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.71428571428571) internal successors, (656), 7 states have internal predecessors, (656), 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:51:07,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:07,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:07,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:51:07,308 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:51:07,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:07,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1810256449, now seen corresponding path program 2 times [2023-11-19 07:51:07,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:07,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810747686] [2023-11-19 07:51:07,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:07,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:51:07,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:51:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:51:07,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:51:07,475 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:51:07,476 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-19 07:51:07,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-19 07:51:07,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-19 07:51:07,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-19 07:51:07,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-19 07:51:07,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-19 07:51:07,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:51:07,481 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:07,487 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:51:07,487 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:51:07,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:51:07,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:51:07,554 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:51:07,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:51:07 BasicIcfg [2023-11-19 07:51:07,580 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:51:07,581 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:51:07,581 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:51:07,581 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:51:07,582 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:50:55" (3/4) ... [2023-11-19 07:51:07,582 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 07:51:07,616 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:51:07,616 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:51:07,617 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:51:07,679 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c011191-aff9-4b89-b2b8-f3359744fefc/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:51:07,679 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:51:07,680 INFO L158 Benchmark]: Toolchain (without parser) took 13862.82ms. Allocated memory was 161.5MB in the beginning and 302.0MB in the end (delta: 140.5MB). Free memory was 113.2MB in the beginning and 169.7MB in the end (delta: -56.5MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. [2023-11-19 07:51:07,680 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 161.5MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:51:07,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 636.19ms. Allocated memory is still 161.5MB. Free memory was 113.2MB in the beginning and 89.3MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-19 07:51:07,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.93ms. Allocated memory is still 161.5MB. Free memory was 89.3MB in the beginning and 87.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:51:07,682 INFO L158 Benchmark]: Boogie Preprocessor took 63.46ms. Allocated memory is still 161.5MB. Free memory was 87.2MB in the beginning and 85.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:51:07,682 INFO L158 Benchmark]: RCFGBuilder took 990.81ms. Allocated memory was 161.5MB in the beginning and 209.7MB in the end (delta: 48.2MB). Free memory was 85.1MB in the beginning and 168.9MB in the end (delta: -83.8MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2023-11-19 07:51:07,683 INFO L158 Benchmark]: TraceAbstraction took 12006.48ms. Allocated memory was 209.7MB in the beginning and 302.0MB in the end (delta: 92.3MB). Free memory was 167.8MB in the beginning and 179.2MB in the end (delta: -11.3MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. [2023-11-19 07:51:07,683 INFO L158 Benchmark]: Witness Printer took 98.84ms. Allocated memory is still 302.0MB. Free memory was 179.2MB in the beginning and 169.7MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-19 07:51:07,685 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.46ms. Allocated memory is still 161.5MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 636.19ms. Allocated memory is still 161.5MB. Free memory was 113.2MB in the beginning and 89.3MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.93ms. Allocated memory is still 161.5MB. Free memory was 89.3MB in the beginning and 87.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.46ms. Allocated memory is still 161.5MB. Free memory was 87.2MB in the beginning and 85.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 990.81ms. Allocated memory was 161.5MB in the beginning and 209.7MB in the end (delta: 48.2MB). Free memory was 85.1MB in the beginning and 168.9MB in the end (delta: -83.8MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12006.48ms. Allocated memory was 209.7MB in the beginning and 302.0MB in the end (delta: 92.3MB). Free memory was 167.8MB in the beginning and 179.2MB in the end (delta: -11.3MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. * Witness Printer took 98.84ms. Allocated memory is still 302.0MB. Free memory was 179.2MB in the beginning and 169.7MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 115 PlacesBefore, 33 PlacesAfterwards, 108 TransitionsBefore, 24 TransitionsAfterwards, 2218 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 98 TotalNumberOfCompositions, 4996 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2460, independent: 2305, independent conditional: 0, independent unconditional: 2305, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1205, independent: 1161, independent conditional: 0, independent unconditional: 1161, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2460, independent: 1144, independent conditional: 0, independent unconditional: 1144, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 1205, unknown conditional: 0, unknown unconditional: 1205] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 57, Positive conditional cache size: 0, Positive unconditional cache size: 57, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1489; [L832] FCALL, FORK 0 pthread_create(&t1489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 0 pthread_t t1490; [L834] FCALL, FORK 0 pthread_create(&t1490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L835] 0 pthread_t t1491; [L836] FCALL, FORK 0 pthread_create(&t1491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 1 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_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=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EAX = z [L805] 3 z = z$flush_delayed ? z$mem_tmp : z [L806] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L846] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L849] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 836]: 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: 834]: 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 7 procedures, 137 locations, 6 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: 11.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 257 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 113 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 679 IncrementalHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 50 mSDtfsCounter, 679 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=279occurred in iteration=7, InterpolantAutomatonStates: 36, 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.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 527 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-19 07:51:07,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c011191-aff9-4b89-b2b8-f3359744fefc/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