./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1a50b8-7888-4c5c-bb09-0eb42c7573c4/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1a50b8-7888-4c5c-bb09-0eb42c7573c4/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_7a1a50b8-7888-4c5c-bb09-0eb42c7573c4/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1a50b8-7888-4c5c-bb09-0eb42c7573c4/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1a50b8-7888-4c5c-bb09-0eb42c7573c4/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_7a1a50b8-7888-4c5c-bb09-0eb42c7573c4/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 ed015c7abb1e633204d95cacfb8444fc40c913627602030095cae55094cd4434 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:05:40,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:05:40,817 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1a50b8-7888-4c5c-bb09-0eb42c7573c4/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 08:05:40,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:05:40,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:05:40,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:05:40,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:05:40,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:05:40,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:05:40,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:05:40,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:05:40,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:05:40,863 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:05:40,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:05:40,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 08:05:40,865 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:05:40,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:05:40,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:05:40,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:05:40,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 08:05:40,868 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:05:40,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 08:05:40,869 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:05:40,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:05:40,870 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:05:40,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:05:40,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:05:40,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:05:40,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:05:40,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:05:40,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:05:40,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 08:05:40,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:05:40,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:05:40,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:05:40,875 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 08:05:40,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:05:40,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:05:40,876 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:05:40,876 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_7a1a50b8-7888-4c5c-bb09-0eb42c7573c4/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_7a1a50b8-7888-4c5c-bb09-0eb42c7573c4/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 -> ed015c7abb1e633204d95cacfb8444fc40c913627602030095cae55094cd4434 [2023-11-19 08:05:41,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:05:41,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:05:41,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:05:41,291 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:05:41,292 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:05:41,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1a50b8-7888-4c5c-bb09-0eb42c7573c4/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2023-11-19 08:05:44,392 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:05:44,690 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:05:44,690 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1a50b8-7888-4c5c-bb09-0eb42c7573c4/sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2023-11-19 08:05:44,710 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1a50b8-7888-4c5c-bb09-0eb42c7573c4/bin/uautomizer-verify-uCwYo4JHxu/data/7fd86dd7f/16b272c2c0e84873805c60fe75c59d00/FLAGbbf7ad0ec [2023-11-19 08:05:44,724 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1a50b8-7888-4c5c-bb09-0eb42c7573c4/bin/uautomizer-verify-uCwYo4JHxu/data/7fd86dd7f/16b272c2c0e84873805c60fe75c59d00 [2023-11-19 08:05:44,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:05:44,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:05:44,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:05:44,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:05:44,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:05:44,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:05:44" (1/1) ... [2023-11-19 08:05:44,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cecc53b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:44, skipping insertion in model container [2023-11-19 08:05:44,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:05:44" (1/1) ... [2023-11-19 08:05:44,797 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:05:45,050 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_7a1a50b8-7888-4c5c-bb09-0eb42c7573c4/sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i[966,979] [2023-11-19 08:05:45,404 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:05:45,420 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:05:45,436 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_7a1a50b8-7888-4c5c-bb09-0eb42c7573c4/sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i[966,979] [2023-11-19 08:05:45,526 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:05:45,590 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:05:45,590 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:05:45,598 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:05:45,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:45 WrapperNode [2023-11-19 08:05:45,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:05:45,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:05:45,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:05:45,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:05:45,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:45" (1/1) ... [2023-11-19 08:05:45,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:45" (1/1) ... [2023-11-19 08:05:45,697 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2023-11-19 08:05:45,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:05:45,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:05:45,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:05:45,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:05:45,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:45" (1/1) ... [2023-11-19 08:05:45,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:45" (1/1) ... [2023-11-19 08:05:45,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:45" (1/1) ... [2023-11-19 08:05:45,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:45" (1/1) ... [2023-11-19 08:05:45,739 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:45" (1/1) ... [2023-11-19 08:05:45,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:45" (1/1) ... [2023-11-19 08:05:45,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:45" (1/1) ... [2023-11-19 08:05:45,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:45" (1/1) ... [2023-11-19 08:05:45,767 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:05:45,768 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:05:45,768 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:05:45,769 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:05:45,769 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:45" (1/1) ... [2023-11-19 08:05:45,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:05:45,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1a50b8-7888-4c5c-bb09-0eb42c7573c4/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:05:45,813 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1a50b8-7888-4c5c-bb09-0eb42c7573c4/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:05:45,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1a50b8-7888-4c5c-bb09-0eb42c7573c4/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:05:45,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:05:45,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 08:05:45,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:05:45,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:05:45,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:05:45,859 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 08:05:45,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 08:05:45,859 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 08:05:45,860 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 08:05:45,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:05:45,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 08:05:45,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:05:45,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:05:45,862 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 08:05:46,026 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:05:46,028 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:05:46,415 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:05:46,685 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:05:46,685 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 08:05:46,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:05:46 BoogieIcfgContainer [2023-11-19 08:05:46,692 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:05:46,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:05:46,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:05:46,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:05:46,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:05:44" (1/3) ... [2023-11-19 08:05:46,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5366d8f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:05:46, skipping insertion in model container [2023-11-19 08:05:46,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:45" (2/3) ... [2023-11-19 08:05:46,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5366d8f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:05:46, skipping insertion in model container [2023-11-19 08:05:46,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:05:46" (3/3) ... [2023-11-19 08:05:46,707 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt_pso.opt_rmo.opt.i [2023-11-19 08:05:46,736 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 08:05:46,748 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:05:46,750 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 08:05:46,751 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:05:46,836 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:05:46,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 94 transitions, 196 flow [2023-11-19 08:05:46,962 INFO L124 PetriNetUnfolderBase]: 3/92 cut-off events. [2023-11-19 08:05:46,965 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:05:46,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 3/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-11-19 08:05:46,975 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 94 transitions, 196 flow [2023-11-19 08:05:46,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 92 transitions, 190 flow [2023-11-19 08:05:46,986 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:05:47,011 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 92 transitions, 190 flow [2023-11-19 08:05:47,017 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 92 transitions, 190 flow [2023-11-19 08:05:47,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 92 transitions, 190 flow [2023-11-19 08:05:47,081 INFO L124 PetriNetUnfolderBase]: 3/92 cut-off events. [2023-11-19 08:05:47,081 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:05:47,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 3/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-11-19 08:05:47,086 INFO L119 LiptonReduction]: Number of co-enabled transitions 1368 [2023-11-19 08:05:52,499 INFO L134 LiptonReduction]: Checked pairs total: 3351 [2023-11-19 08:05:52,499 INFO L136 LiptonReduction]: Total number of compositions: 84 [2023-11-19 08:05:52,516 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:05:52,523 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;@62da9921, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:05:52,524 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-19 08:05:52,528 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:05:52,528 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-19 08:05:52,528 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:05:52,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:52,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 08:05:52,530 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:05:52,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:52,536 INFO L85 PathProgramCache]: Analyzing trace with hash 404937986, now seen corresponding path program 1 times [2023-11-19 08:05:52,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:52,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367672817] [2023-11-19 08:05:52,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:52,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:53,182 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 08:05:53,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:53,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367672817] [2023-11-19 08:05:53,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367672817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:53,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:53,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:05:53,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947709431] [2023-11-19 08:05:53,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:53,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:05:53,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:53,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:05:53,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:05:53,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 178 [2023-11-19 08:05:53,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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 08:05:53,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:53,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 178 [2023-11-19 08:05:53,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:53,451 INFO L124 PetriNetUnfolderBase]: 111/261 cut-off events. [2023-11-19 08:05:53,452 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-19 08:05:53,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 261 events. 111/261 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1181 event pairs, 18 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 465. Up to 154 conditions per place. [2023-11-19 08:05:53,459 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 17 selfloop transitions, 2 changer transitions 2/25 dead transitions. [2023-11-19 08:05:53,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 25 transitions, 98 flow [2023-11-19 08:05:53,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:05:53,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:05:53,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2023-11-19 08:05:53,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49625468164794007 [2023-11-19 08:05:53,489 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 265 transitions. [2023-11-19 08:05:53,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 265 transitions. [2023-11-19 08:05:53,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:53,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 265 transitions. [2023-11-19 08:05:53,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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 08:05:53,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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 08:05:53,512 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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 08:05:53,514 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 44 flow. Second operand 3 states and 265 transitions. [2023-11-19 08:05:53,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 25 transitions, 98 flow [2023-11-19 08:05:53,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 25 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:05:53,520 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 42 flow [2023-11-19 08:05:53,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2023-11-19 08:05:53,527 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-11-19 08:05:53,527 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 42 flow [2023-11-19 08:05:53,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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 08:05:53,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:53,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:53,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:05:53,529 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:05:53,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:53,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1696562833, now seen corresponding path program 1 times [2023-11-19 08:05:53,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:53,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698812247] [2023-11-19 08:05:53,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:53,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:54,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 08:05:54,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:54,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698812247] [2023-11-19 08:05:54,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698812247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:54,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:54,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:05:54,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794284121] [2023-11-19 08:05:54,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:54,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:05:54,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:54,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:05:54,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:05:54,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 178 [2023-11-19 08:05:54,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 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 08:05:54,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:54,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 178 [2023-11-19 08:05:54,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:54,559 INFO L124 PetriNetUnfolderBase]: 144/262 cut-off events. [2023-11-19 08:05:54,559 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-19 08:05:54,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 262 events. 144/262 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 896 event pairs, 67 based on Foata normal form. 20/281 useless extension candidates. Maximal degree in co-relation 537. Up to 121 conditions per place. [2023-11-19 08:05:54,568 INFO L140 encePairwiseOnDemand]: 171/178 looper letters, 21 selfloop transitions, 6 changer transitions 0/28 dead transitions. [2023-11-19 08:05:54,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 118 flow [2023-11-19 08:05:54,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:05:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:05:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 313 transitions. [2023-11-19 08:05:54,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4396067415730337 [2023-11-19 08:05:54,573 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 313 transitions. [2023-11-19 08:05:54,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 313 transitions. [2023-11-19 08:05:54,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:54,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 313 transitions. [2023-11-19 08:05:54,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 78.25) internal successors, (313), 4 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 08:05:54,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 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 08:05:54,580 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 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 08:05:54,580 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 42 flow. Second operand 4 states and 313 transitions. [2023-11-19 08:05:54,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 118 flow [2023-11-19 08:05:54,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:05:54,582 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 77 flow [2023-11-19 08:05:54,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=77, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2023-11-19 08:05:54,584 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 1 predicate places. [2023-11-19 08:05:54,584 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 77 flow [2023-11-19 08:05:54,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 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 08:05:54,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:54,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:54,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:05:54,586 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:05:54,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:54,586 INFO L85 PathProgramCache]: Analyzing trace with hash 331133340, now seen corresponding path program 1 times [2023-11-19 08:05:54,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:54,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808378030] [2023-11-19 08:05:54,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:54,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:54,808 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 08:05:54,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:54,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808378030] [2023-11-19 08:05:54,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808378030] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:54,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:54,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:05:54,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163878473] [2023-11-19 08:05:54,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:54,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:05:54,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:54,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:05:54,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:05:54,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 178 [2023-11-19 08:05:54,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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 08:05:54,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:54,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 178 [2023-11-19 08:05:54,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:54,966 INFO L124 PetriNetUnfolderBase]: 156/321 cut-off events. [2023-11-19 08:05:54,967 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2023-11-19 08:05:54,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 321 events. 156/321 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1446 event pairs, 59 based on Foata normal form. 12/325 useless extension candidates. Maximal degree in co-relation 836. Up to 178 conditions per place. [2023-11-19 08:05:54,970 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 21 selfloop transitions, 3 changer transitions 4/31 dead transitions. [2023-11-19 08:05:54,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 31 transitions, 170 flow [2023-11-19 08:05:54,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:05:54,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:05:54,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2023-11-19 08:05:54,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4850187265917603 [2023-11-19 08:05:54,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 259 transitions. [2023-11-19 08:05:54,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 259 transitions. [2023-11-19 08:05:54,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:54,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 259 transitions. [2023-11-19 08:05:54,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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 08:05:54,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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 08:05:54,980 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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 08:05:54,981 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 77 flow. Second operand 3 states and 259 transitions. [2023-11-19 08:05:54,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 31 transitions, 170 flow [2023-11-19 08:05:54,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 31 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:05:54,985 INFO L231 Difference]: Finished difference. Result has 28 places, 21 transitions, 81 flow [2023-11-19 08:05:54,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=28, PETRI_TRANSITIONS=21} [2023-11-19 08:05:54,986 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2023-11-19 08:05:54,987 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 81 flow [2023-11-19 08:05:54,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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 08:05:54,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:54,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:54,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:05:54,989 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:05:54,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:54,990 INFO L85 PathProgramCache]: Analyzing trace with hash -273208982, now seen corresponding path program 1 times [2023-11-19 08:05:54,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:54,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523170529] [2023-11-19 08:05:54,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:54,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:55,687 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 08:05:55,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:55,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523170529] [2023-11-19 08:05:55,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523170529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:55,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:55,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:05:55,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655387320] [2023-11-19 08:05:55,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:55,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:05:55,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:55,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:05:55,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:05:55,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 178 [2023-11-19 08:05:55,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 81.8) internal successors, (409), 5 states have internal predecessors, (409), 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 08:05:55,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:55,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 178 [2023-11-19 08:05:55,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:55,865 INFO L124 PetriNetUnfolderBase]: 75/156 cut-off events. [2023-11-19 08:05:55,865 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2023-11-19 08:05:55,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 156 events. 75/156 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 508 event pairs, 14 based on Foata normal form. 1/153 useless extension candidates. Maximal degree in co-relation 434. Up to 112 conditions per place. [2023-11-19 08:05:55,868 INFO L140 encePairwiseOnDemand]: 173/178 looper letters, 20 selfloop transitions, 6 changer transitions 0/30 dead transitions. [2023-11-19 08:05:55,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 168 flow [2023-11-19 08:05:55,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:05:55,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:05:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 341 transitions. [2023-11-19 08:05:55,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4789325842696629 [2023-11-19 08:05:55,871 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 341 transitions. [2023-11-19 08:05:55,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 341 transitions. [2023-11-19 08:05:55,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:55,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 341 transitions. [2023-11-19 08:05:55,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 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 08:05:55,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 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 08:05:55,877 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 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 08:05:55,877 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 81 flow. Second operand 4 states and 341 transitions. [2023-11-19 08:05:55,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 30 transitions, 168 flow [2023-11-19 08:05:55,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 30 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:05:55,880 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 112 flow [2023-11-19 08:05:55,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2023-11-19 08:05:55,881 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2023-11-19 08:05:55,881 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 112 flow [2023-11-19 08:05:55,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.8) internal successors, (409), 5 states have internal predecessors, (409), 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 08:05:55,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:55,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:55,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 08:05:55,883 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:05:55,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:55,883 INFO L85 PathProgramCache]: Analyzing trace with hash 47646091, now seen corresponding path program 1 times [2023-11-19 08:05:55,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:55,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447391617] [2023-11-19 08:05:55,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:55,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:56,354 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 08:05:56,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:56,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447391617] [2023-11-19 08:05:56,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447391617] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:56,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:56,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:05:56,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382030766] [2023-11-19 08:05:56,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:56,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:05:56,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:56,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:05:56,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:05:56,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 178 [2023-11-19 08:05:56,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 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 08:05:56,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:56,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 178 [2023-11-19 08:05:56,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:56,708 INFO L124 PetriNetUnfolderBase]: 150/291 cut-off events. [2023-11-19 08:05:56,708 INFO L125 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2023-11-19 08:05:56,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 291 events. 150/291 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1189 event pairs, 24 based on Foata normal form. 8/299 useless extension candidates. Maximal degree in co-relation 907. Up to 139 conditions per place. [2023-11-19 08:05:56,711 INFO L140 encePairwiseOnDemand]: 168/178 looper letters, 22 selfloop transitions, 16 changer transitions 14/53 dead transitions. [2023-11-19 08:05:56,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 341 flow [2023-11-19 08:05:56,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:05:56,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:05:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 468 transitions. [2023-11-19 08:05:56,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43820224719101125 [2023-11-19 08:05:56,715 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 468 transitions. [2023-11-19 08:05:56,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 468 transitions. [2023-11-19 08:05:56,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:56,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 468 transitions. [2023-11-19 08:05:56,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 78.0) internal successors, (468), 6 states have internal predecessors, (468), 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 08:05:56,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 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 08:05:56,724 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 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 08:05:56,724 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 112 flow. Second operand 6 states and 468 transitions. [2023-11-19 08:05:56,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 53 transitions, 341 flow [2023-11-19 08:05:56,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 53 transitions, 327 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:05:56,731 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 211 flow [2023-11-19 08:05:56,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2023-11-19 08:05:56,735 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2023-11-19 08:05:56,735 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 211 flow [2023-11-19 08:05:56,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 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 08:05:56,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:56,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:56,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:05:56,736 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:05:56,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:56,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1586627407, now seen corresponding path program 2 times [2023-11-19 08:05:56,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:56,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105153335] [2023-11-19 08:05:56,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:56,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:57,026 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 08:05:57,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:57,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105153335] [2023-11-19 08:05:57,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105153335] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:57,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:57,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:05:57,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643390451] [2023-11-19 08:05:57,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:57,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:05:57,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:57,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:05:57,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:05:57,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 178 [2023-11-19 08:05:57,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 211 flow. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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 08:05:57,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:57,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 178 [2023-11-19 08:05:57,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:57,181 INFO L124 PetriNetUnfolderBase]: 116/245 cut-off events. [2023-11-19 08:05:57,182 INFO L125 PetriNetUnfolderBase]: For 375/375 co-relation queries the response was YES. [2023-11-19 08:05:57,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 245 events. 116/245 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 983 event pairs, 10 based on Foata normal form. 8/253 useless extension candidates. Maximal degree in co-relation 859. Up to 118 conditions per place. [2023-11-19 08:05:57,185 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 25 selfloop transitions, 2 changer transitions 14/44 dead transitions. [2023-11-19 08:05:57,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 44 transitions, 345 flow [2023-11-19 08:05:57,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:05:57,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:05:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 335 transitions. [2023-11-19 08:05:57,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4705056179775281 [2023-11-19 08:05:57,188 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 335 transitions. [2023-11-19 08:05:57,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 335 transitions. [2023-11-19 08:05:57,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:57,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 335 transitions. [2023-11-19 08:05:57,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 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 08:05:57,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 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 08:05:57,193 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 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 08:05:57,193 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 211 flow. Second operand 4 states and 335 transitions. [2023-11-19 08:05:57,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 44 transitions, 345 flow [2023-11-19 08:05:57,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 343 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-19 08:05:57,200 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 164 flow [2023-11-19 08:05:57,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-11-19 08:05:57,203 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2023-11-19 08:05:57,204 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 164 flow [2023-11-19 08:05:57,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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 08:05:57,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:57,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:57,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 08:05:57,205 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:05:57,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:57,206 INFO L85 PathProgramCache]: Analyzing trace with hash 462994389, now seen corresponding path program 3 times [2023-11-19 08:05:57,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:57,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517179949] [2023-11-19 08:05:57,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:57,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:57,470 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 08:05:57,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:57,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517179949] [2023-11-19 08:05:57,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517179949] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:57,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:57,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:05:57,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091010065] [2023-11-19 08:05:57,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:57,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:05:57,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:57,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:05:57,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:05:57,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 178 [2023-11-19 08:05:57,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 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 08:05:57,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:57,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 178 [2023-11-19 08:05:57,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:57,583 INFO L124 PetriNetUnfolderBase]: 32/85 cut-off events. [2023-11-19 08:05:57,583 INFO L125 PetriNetUnfolderBase]: For 191/194 co-relation queries the response was YES. [2023-11-19 08:05:57,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 85 events. 32/85 cut-off events. For 191/194 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 227 event pairs, 6 based on Foata normal form. 19/104 useless extension candidates. Maximal degree in co-relation 296. Up to 42 conditions per place. [2023-11-19 08:05:57,585 INFO L140 encePairwiseOnDemand]: 173/178 looper letters, 19 selfloop transitions, 3 changer transitions 16/42 dead transitions. [2023-11-19 08:05:57,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 327 flow [2023-11-19 08:05:57,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:05:57,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:05:57,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 417 transitions. [2023-11-19 08:05:57,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46853932584269664 [2023-11-19 08:05:57,589 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 417 transitions. [2023-11-19 08:05:57,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 417 transitions. [2023-11-19 08:05:57,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:57,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 417 transitions. [2023-11-19 08:05:57,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 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 08:05:57,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 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 08:05:57,595 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 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 08:05:57,595 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 164 flow. Second operand 5 states and 417 transitions. [2023-11-19 08:05:57,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 327 flow [2023-11-19 08:05:57,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 285 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-19 08:05:57,601 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 128 flow [2023-11-19 08:05:57,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2023-11-19 08:05:57,603 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 12 predicate places. [2023-11-19 08:05:57,604 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 128 flow [2023-11-19 08:05:57,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 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 08:05:57,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:57,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:57,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 08:05:57,606 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:05:57,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:57,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1205431847, now seen corresponding path program 1 times [2023-11-19 08:05:57,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:57,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457511929] [2023-11-19 08:05:57,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:57,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:57,938 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 08:05:57,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:57,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457511929] [2023-11-19 08:05:57,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457511929] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:57,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:57,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:05:57,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954709514] [2023-11-19 08:05:57,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:57,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:05:57,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:57,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:05:57,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:05:57,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 178 [2023-11-19 08:05:57,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 79.2) internal successors, (396), 5 states have internal predecessors, (396), 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 08:05:57,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:57,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 178 [2023-11-19 08:05:57,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:58,055 INFO L124 PetriNetUnfolderBase]: 10/40 cut-off events. [2023-11-19 08:05:58,055 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-11-19 08:05:58,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 40 events. 10/40 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 6/46 useless extension candidates. Maximal degree in co-relation 146. Up to 16 conditions per place. [2023-11-19 08:05:58,056 INFO L140 encePairwiseOnDemand]: 173/178 looper letters, 17 selfloop transitions, 5 changer transitions 6/32 dead transitions. [2023-11-19 08:05:58,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 32 transitions, 240 flow [2023-11-19 08:05:58,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:05:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:05:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 488 transitions. [2023-11-19 08:05:58,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45692883895131087 [2023-11-19 08:05:58,060 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 488 transitions. [2023-11-19 08:05:58,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 488 transitions. [2023-11-19 08:05:58,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:58,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 488 transitions. [2023-11-19 08:05:58,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 81.33333333333333) internal successors, (488), 6 states have internal predecessors, (488), 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 08:05:58,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 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 08:05:58,067 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 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 08:05:58,068 INFO L175 Difference]: Start difference. First operand has 38 places, 23 transitions, 128 flow. Second operand 6 states and 488 transitions. [2023-11-19 08:05:58,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 32 transitions, 240 flow [2023-11-19 08:05:58,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 203 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-11-19 08:05:58,070 INFO L231 Difference]: Finished difference. Result has 40 places, 23 transitions, 121 flow [2023-11-19 08:05:58,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=121, PETRI_PLACES=40, PETRI_TRANSITIONS=23} [2023-11-19 08:05:58,071 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 14 predicate places. [2023-11-19 08:05:58,071 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 23 transitions, 121 flow [2023-11-19 08:05:58,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.2) internal successors, (396), 5 states have internal predecessors, (396), 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 08:05:58,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:58,072 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 08:05:58,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 08:05:58,072 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:05:58,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:58,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1632425696, now seen corresponding path program 1 times [2023-11-19 08:05:58,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:58,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850591057] [2023-11-19 08:05:58,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:58,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:59,519 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 08:05:59,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:59,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850591057] [2023-11-19 08:05:59,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850591057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:59,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:59,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:05:59,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641150630] [2023-11-19 08:05:59,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:59,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 08:05:59,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:59,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 08:05:59,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:05:59,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 178 [2023-11-19 08:05:59,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 23 transitions, 121 flow. Second operand has 8 states, 8 states have (on average 78.75) internal successors, (630), 8 states have internal predecessors, (630), 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 08:05:59,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:59,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 178 [2023-11-19 08:05:59,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:59,853 INFO L124 PetriNetUnfolderBase]: 9/42 cut-off events. [2023-11-19 08:05:59,853 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2023-11-19 08:05:59,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 42 events. 9/42 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 64 event pairs, 2 based on Foata normal form. 1/43 useless extension candidates. Maximal degree in co-relation 153. Up to 19 conditions per place. [2023-11-19 08:05:59,854 INFO L140 encePairwiseOnDemand]: 172/178 looper letters, 15 selfloop transitions, 4 changer transitions 11/33 dead transitions. [2023-11-19 08:05:59,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 33 transitions, 247 flow [2023-11-19 08:05:59,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:05:59,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:05:59,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 564 transitions. [2023-11-19 08:05:59,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45264847512038525 [2023-11-19 08:05:59,858 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 564 transitions. [2023-11-19 08:05:59,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 564 transitions. [2023-11-19 08:05:59,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:59,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 564 transitions. [2023-11-19 08:05:59,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 80.57142857142857) internal successors, (564), 7 states have internal predecessors, (564), 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 08:05:59,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 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 08:05:59,866 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 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 08:05:59,866 INFO L175 Difference]: Start difference. First operand has 40 places, 23 transitions, 121 flow. Second operand 7 states and 564 transitions. [2023-11-19 08:05:59,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 33 transitions, 247 flow [2023-11-19 08:05:59,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 211 flow, removed 12 selfloop flow, removed 5 redundant places. [2023-11-19 08:05:59,868 INFO L231 Difference]: Finished difference. Result has 42 places, 21 transitions, 107 flow [2023-11-19 08:05:59,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=107, PETRI_PLACES=42, PETRI_TRANSITIONS=21} [2023-11-19 08:05:59,869 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2023-11-19 08:05:59,869 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 21 transitions, 107 flow [2023-11-19 08:05:59,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 78.75) internal successors, (630), 8 states have internal predecessors, (630), 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 08:05:59,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:59,870 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 08:05:59,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 08:05:59,871 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 08:05:59,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:59,872 INFO L85 PathProgramCache]: Analyzing trace with hash -883126792, now seen corresponding path program 2 times [2023-11-19 08:05:59,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:59,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666711360] [2023-11-19 08:05:59,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:59,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:05:59,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:05:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:05:59,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:05:59,997 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:05:59,998 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-19 08:06:00,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-19 08:06:00,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-19 08:06:00,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-19 08:06:00,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-19 08:06:00,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 08:06:00,003 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2023-11-19 08:06:00,010 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 08:06:00,010 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 08:06:00,048 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 08:06:00,050 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 08:06:00,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:06:00 BasicIcfg [2023-11-19 08:06:00,069 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 08:06:00,070 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 08:06:00,070 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 08:06:00,070 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 08:06:00,071 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:05:46" (3/4) ... [2023-11-19 08:06:00,072 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 08:06:00,090 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 08:06:00,091 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 08:06:00,147 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1a50b8-7888-4c5c-bb09-0eb42c7573c4/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 08:06:00,147 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 08:06:00,148 INFO L158 Benchmark]: Toolchain (without parser) took 15419.02ms. Allocated memory was 138.4MB in the beginning and 243.3MB in the end (delta: 104.9MB). Free memory was 99.5MB in the beginning and 107.8MB in the end (delta: -8.3MB). Peak memory consumption was 95.1MB. Max. memory is 16.1GB. [2023-11-19 08:06:00,148 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 109.1MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:06:00,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 869.07ms. Allocated memory is still 138.4MB. Free memory was 99.5MB in the beginning and 97.0MB in the end (delta: 2.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 08:06:00,149 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.74ms. Allocated memory is still 138.4MB. Free memory was 96.5MB in the beginning and 93.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:06:00,149 INFO L158 Benchmark]: Boogie Preprocessor took 67.55ms. Allocated memory is still 138.4MB. Free memory was 93.8MB in the beginning and 92.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:06:00,150 INFO L158 Benchmark]: RCFGBuilder took 924.35ms. Allocated memory is still 138.4MB. Free memory was 92.3MB in the beginning and 108.0MB in the end (delta: -15.7MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2023-11-19 08:06:00,150 INFO L158 Benchmark]: TraceAbstraction took 13373.54ms. Allocated memory was 138.4MB in the beginning and 243.3MB in the end (delta: 104.9MB). Free memory was 107.3MB in the beginning and 114.1MB in the end (delta: -6.9MB). Peak memory consumption was 97.1MB. Max. memory is 16.1GB. [2023-11-19 08:06:00,151 INFO L158 Benchmark]: Witness Printer took 77.40ms. Allocated memory is still 243.3MB. Free memory was 114.1MB in the beginning and 107.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-19 08:06:00,153 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.24ms. Allocated memory is still 109.1MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 869.07ms. Allocated memory is still 138.4MB. Free memory was 99.5MB in the beginning and 97.0MB in the end (delta: 2.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.74ms. Allocated memory is still 138.4MB. Free memory was 96.5MB in the beginning and 93.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.55ms. Allocated memory is still 138.4MB. Free memory was 93.8MB in the beginning and 92.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 924.35ms. Allocated memory is still 138.4MB. Free memory was 92.3MB in the beginning and 108.0MB in the end (delta: -15.7MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13373.54ms. Allocated memory was 138.4MB in the beginning and 243.3MB in the end (delta: 104.9MB). Free memory was 107.3MB in the beginning and 114.1MB in the end (delta: -6.9MB). Peak memory consumption was 97.1MB. Max. memory is 16.1GB. * Witness Printer took 77.40ms. Allocated memory is still 243.3MB. Free memory was 114.1MB in the beginning and 107.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 96 PlacesBefore, 26 PlacesAfterwards, 92 TransitionsBefore, 19 TransitionsAfterwards, 1368 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 84 TotalNumberOfCompositions, 3351 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1583, independent: 1437, independent conditional: 0, independent unconditional: 1437, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 754, independent: 707, independent conditional: 0, independent unconditional: 707, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1583, independent: 730, independent conditional: 0, independent unconditional: 730, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 754, unknown conditional: 0, unknown unconditional: 754] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L800] 0 pthread_t t1587; [L801] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1587={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L802] 0 pthread_t t1588; [L803] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1587={5:0}, t1588={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L807] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L807] RET 0 assume_abort_if_not(main$tmp_guard0) [L809] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1587={5:0}, t1588={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L821] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L822] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L823] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L824] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L826] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 801]: 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: 803]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 113 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 262 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 141 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 568 IncrementalHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 43 mSDtfsCounter, 568 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=5, InterpolantAutomatonStates: 42, 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, 4.6s InterpolantComputationTime, 122 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 1160 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 08:06:00,197 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a1a50b8-7888-4c5c-bb09-0eb42c7573c4/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