./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4700705-3578-434f-b80e-4adc7d44669c/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4700705-3578-434f-b80e-4adc7d44669c/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4700705-3578-434f-b80e-4adc7d44669c/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4700705-3578-434f-b80e-4adc7d44669c/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4700705-3578-434f-b80e-4adc7d44669c/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4700705-3578-434f-b80e-4adc7d44669c/bin/uautomizer-verify-uTZkv6EMXl --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 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:11:21,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:11:21,823 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4700705-3578-434f-b80e-4adc7d44669c/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:11:21,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:11:21,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:11:21,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:11:21,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:11:21,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:11:21,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:11:21,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:11:21,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:11:21,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:11:21,883 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:11:21,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:11:21,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:11:21,886 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:11:21,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:11:21,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:11:21,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:11:21,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:11:21,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:11:21,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:11:21,889 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:11:21,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:11:21,890 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:11:21,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:11:21,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:11:21,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:11:21,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:11:21,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:11:21,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:11:21,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:11:21,912 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:11:21,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:11:21,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:11:21,913 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:11:21,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:11:21,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:11:21,914 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:11:21,914 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_a4700705-3578-434f-b80e-4adc7d44669c/bin/uautomizer-verify-uTZkv6EMXl/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_a4700705-3578-434f-b80e-4adc7d44669c/bin/uautomizer-verify-uTZkv6EMXl 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 -> 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 [2023-11-12 02:11:22,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:11:22,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:11:22,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:11:22,258 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:11:22,259 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:11:22,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4700705-3578-434f-b80e-4adc7d44669c/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-11-12 02:11:25,548 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:11:25,860 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:11:25,862 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4700705-3578-434f-b80e-4adc7d44669c/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-11-12 02:11:25,885 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4700705-3578-434f-b80e-4adc7d44669c/bin/uautomizer-verify-uTZkv6EMXl/data/dc5501af6/4e47312e76a540c5916e7f6d55312ce9/FLAG20b9d0928 [2023-11-12 02:11:25,900 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4700705-3578-434f-b80e-4adc7d44669c/bin/uautomizer-verify-uTZkv6EMXl/data/dc5501af6/4e47312e76a540c5916e7f6d55312ce9 [2023-11-12 02:11:25,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:11:25,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:11:25,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:11:25,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:11:25,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:11:25,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:11:25" (1/1) ... [2023-11-12 02:11:25,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e6972fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:11:25, skipping insertion in model container [2023-11-12 02:11:25,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:11:25" (1/1) ... [2023-11-12 02:11:25,988 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:11:26,154 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_a4700705-3578-434f-b80e-4adc7d44669c/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-11-12 02:11:26,457 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:11:26,474 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:11:26,487 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_a4700705-3578-434f-b80e-4adc7d44669c/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-11-12 02:11:26,573 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:11:26,619 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:11:26,620 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:11:26,628 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:11:26,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:11:26 WrapperNode [2023-11-12 02:11:26,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:11:26,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:11:26,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:11:26,631 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:11:26,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:11:26" (1/1) ... [2023-11-12 02:11:26,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:11:26" (1/1) ... [2023-11-12 02:11:26,725 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2023-11-12 02:11:26,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:11:26,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:11:26,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:11:26,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:11:26,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:11:26" (1/1) ... [2023-11-12 02:11:26,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:11:26" (1/1) ... [2023-11-12 02:11:26,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:11:26" (1/1) ... [2023-11-12 02:11:26,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:11:26" (1/1) ... [2023-11-12 02:11:26,777 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:11:26" (1/1) ... [2023-11-12 02:11:26,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:11:26" (1/1) ... [2023-11-12 02:11:26,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:11:26" (1/1) ... [2023-11-12 02:11:26,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:11:26" (1/1) ... [2023-11-12 02:11:26,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:11:26,813 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:11:26,813 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:11:26,813 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:11:26,814 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:11:26" (1/1) ... [2023-11-12 02:11:26,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:11:26,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4700705-3578-434f-b80e-4adc7d44669c/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:11:26,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4700705-3578-434f-b80e-4adc7d44669c/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:11:26,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4700705-3578-434f-b80e-4adc7d44669c/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:11:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:11:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:11:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:11:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:11:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:11:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:11:26,901 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:11:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:11:26,901 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:11:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:11:26,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:11:26,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:11:26,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:11:26,905 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:11:27,105 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:11:27,107 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:11:27,471 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:11:27,684 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:11:27,684 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:11:27,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:11:27 BoogieIcfgContainer [2023-11-12 02:11:27,690 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:11:27,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:11:27,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:11:27,699 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:11:27,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:11:25" (1/3) ... [2023-11-12 02:11:27,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b2091d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:11:27, skipping insertion in model container [2023-11-12 02:11:27,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:11:26" (2/3) ... [2023-11-12 02:11:27,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b2091d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:11:27, skipping insertion in model container [2023-11-12 02:11:27,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:11:27" (3/3) ... [2023-11-12 02:11:27,705 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-11-12 02:11:27,713 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 02:11:27,722 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:11:27,723 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-12 02:11:27,723 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:11:27,779 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:11:27,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 186 flow [2023-11-12 02:11:27,916 INFO L124 PetriNetUnfolderBase]: 2/87 cut-off events. [2023-11-12 02:11:27,916 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:11:27,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2023-11-12 02:11:27,923 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 186 flow [2023-11-12 02:11:27,930 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 87 transitions, 180 flow [2023-11-12 02:11:27,934 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:11:27,957 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 87 transitions, 180 flow [2023-11-12 02:11:27,959 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 87 transitions, 180 flow [2023-11-12 02:11:27,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 180 flow [2023-11-12 02:11:27,988 INFO L124 PetriNetUnfolderBase]: 2/87 cut-off events. [2023-11-12 02:11:27,989 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:11:27,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2023-11-12 02:11:27,991 INFO L119 LiptonReduction]: Number of co-enabled transitions 1154 [2023-11-12 02:11:31,804 INFO L134 LiptonReduction]: Checked pairs total: 3018 [2023-11-12 02:11:31,804 INFO L136 LiptonReduction]: Total number of compositions: 80 [2023-11-12 02:11:31,826 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:11:31,834 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;@6e32a9c2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:11:31,835 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-12 02:11:31,837 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:11:31,838 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-12 02:11:31,838 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:11:31,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:11:31,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-12 02:11:31,840 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:11:31,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:11:31,845 INFO L85 PathProgramCache]: Analyzing trace with hash 405663, now seen corresponding path program 1 times [2023-11-12 02:11:31,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:11:31,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671952198] [2023-11-12 02:11:31,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:11:31,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:11:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:11:32,299 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-12 02:11:32,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:11:32,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671952198] [2023-11-12 02:11:32,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671952198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:11:32,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:11:32,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:11:32,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133112443] [2023-11-12 02:11:32,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:11:32,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:11:32,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:11:32,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:11:32,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:11:32,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 169 [2023-11-12 02:11:32,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-12 02:11:32,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:11:32,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 169 [2023-11-12 02:11:32,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:11:32,517 INFO L124 PetriNetUnfolderBase]: 159/311 cut-off events. [2023-11-12 02:11:32,518 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-12 02:11:32,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 311 events. 159/311 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1409 event pairs, 18 based on Foata normal form. 16/293 useless extension candidates. Maximal degree in co-relation 595. Up to 232 conditions per place. [2023-11-12 02:11:32,523 INFO L140 encePairwiseOnDemand]: 165/169 looper letters, 21 selfloop transitions, 2 changer transitions 4/29 dead transitions. [2023-11-12 02:11:32,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 121 flow [2023-11-12 02:11:32,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:11:32,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:11:32,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2023-11-12 02:11:32,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.514792899408284 [2023-11-12 02:11:32,539 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 261 transitions. [2023-11-12 02:11:32,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 261 transitions. [2023-11-12 02:11:32,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:11:32,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 261 transitions. [2023-11-12 02:11:32,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 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-12 02:11:32,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:11:32,553 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:11:32,555 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 261 transitions. [2023-11-12 02:11:32,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 121 flow [2023-11-12 02:11:32,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:11:32,560 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2023-11-12 02:11:32,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-11-12 02:11:32,565 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-11-12 02:11:32,566 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2023-11-12 02:11:32,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-12 02:11:32,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:11:32,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:11:32,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:11:32,567 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:11:32,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:11:32,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1401108054, now seen corresponding path program 1 times [2023-11-12 02:11:32,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:11:32,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473217594] [2023-11-12 02:11:32,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:11:32,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:11:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:11:33,723 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-12 02:11:33,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:11:33,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473217594] [2023-11-12 02:11:33,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473217594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:11:33,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:11:33,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:11:33,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184141882] [2023-11-12 02:11:33,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:11:33,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:11:33,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:11:33,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:11:33,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:11:33,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 169 [2023-11-12 02:11:33,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 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-12 02:11:33,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:11:33,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 169 [2023-11-12 02:11:33,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:11:34,151 INFO L124 PetriNetUnfolderBase]: 175/341 cut-off events. [2023-11-12 02:11:34,151 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-12 02:11:34,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 341 events. 175/341 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1436 event pairs, 48 based on Foata normal form. 23/364 useless extension candidates. Maximal degree in co-relation 692. Up to 231 conditions per place. [2023-11-12 02:11:34,155 INFO L140 encePairwiseOnDemand]: 161/169 looper letters, 23 selfloop transitions, 8 changer transitions 16/48 dead transitions. [2023-11-12 02:11:34,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 48 transitions, 208 flow [2023-11-12 02:11:34,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:11:34,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:11:34,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 533 transitions. [2023-11-12 02:11:34,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45054945054945056 [2023-11-12 02:11:34,161 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 533 transitions. [2023-11-12 02:11:34,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 533 transitions. [2023-11-12 02:11:34,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:11:34,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 533 transitions. [2023-11-12 02:11:34,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 76.14285714285714) internal successors, (533), 7 states have internal predecessors, (533), 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-12 02:11:34,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 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-12 02:11:34,177 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 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-12 02:11:34,178 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 7 states and 533 transitions. [2023-11-12 02:11:34,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 48 transitions, 208 flow [2023-11-12 02:11:34,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 48 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:11:34,181 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 95 flow [2023-11-12 02:11:34,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=95, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-11-12 02:11:34,183 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2023-11-12 02:11:34,184 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 95 flow [2023-11-12 02:11:34,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 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-12 02:11:34,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:11:34,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:11:34,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:11:34,191 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:11:34,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:11:34,192 INFO L85 PathProgramCache]: Analyzing trace with hash 484684027, now seen corresponding path program 1 times [2023-11-12 02:11:34,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:11:34,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356597570] [2023-11-12 02:11:34,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:11:34,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:11:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:11:34,835 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-12 02:11:34,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:11:34,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356597570] [2023-11-12 02:11:34,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356597570] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:11:34,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:11:34,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:11:34,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881890897] [2023-11-12 02:11:34,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:11:34,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:11:34,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:11:34,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:11:34,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:11:34,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 169 [2023-11-12 02:11:34,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 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-12 02:11:34,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:11:34,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 169 [2023-11-12 02:11:34,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:11:35,171 INFO L124 PetriNetUnfolderBase]: 199/369 cut-off events. [2023-11-12 02:11:35,171 INFO L125 PetriNetUnfolderBase]: For 378/390 co-relation queries the response was YES. [2023-11-12 02:11:35,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 369 events. 199/369 cut-off events. For 378/390 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1503 event pairs, 58 based on Foata normal form. 33/402 useless extension candidates. Maximal degree in co-relation 1125. Up to 283 conditions per place. [2023-11-12 02:11:35,180 INFO L140 encePairwiseOnDemand]: 162/169 looper letters, 29 selfloop transitions, 8 changer transitions 14/53 dead transitions. [2023-11-12 02:11:35,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 311 flow [2023-11-12 02:11:35,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:11:35,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:11:35,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 555 transitions. [2023-11-12 02:11:35,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4691462383770076 [2023-11-12 02:11:35,184 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 555 transitions. [2023-11-12 02:11:35,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 555 transitions. [2023-11-12 02:11:35,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:11:35,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 555 transitions. [2023-11-12 02:11:35,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 79.28571428571429) internal successors, (555), 7 states have internal predecessors, (555), 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-12 02:11:35,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 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-12 02:11:35,191 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 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-12 02:11:35,191 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 95 flow. Second operand 7 states and 555 transitions. [2023-11-12 02:11:35,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 53 transitions, 311 flow [2023-11-12 02:11:35,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 53 transitions, 307 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-12 02:11:35,198 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 168 flow [2023-11-12 02:11:35,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=168, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-11-12 02:11:35,199 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 12 predicate places. [2023-11-12 02:11:35,199 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 168 flow [2023-11-12 02:11:35,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 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-12 02:11:35,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:11:35,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:11:35,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:11:35,200 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:11:35,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:11:35,201 INFO L85 PathProgramCache]: Analyzing trace with hash 2127289673, now seen corresponding path program 1 times [2023-11-12 02:11:35,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:11:35,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408559366] [2023-11-12 02:11:35,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:11:35,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:11:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:11:36,000 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-12 02:11:36,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:11:36,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408559366] [2023-11-12 02:11:36,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408559366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:11:36,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:11:36,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:11:36,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766146682] [2023-11-12 02:11:36,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:11:36,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:11:36,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:11:36,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:11:36,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:11:36,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 169 [2023-11-12 02:11:36,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 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-12 02:11:36,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:11:36,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 169 [2023-11-12 02:11:36,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:11:36,345 INFO L124 PetriNetUnfolderBase]: 231/446 cut-off events. [2023-11-12 02:11:36,346 INFO L125 PetriNetUnfolderBase]: For 987/1014 co-relation queries the response was YES. [2023-11-12 02:11:36,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1694 conditions, 446 events. 231/446 cut-off events. For 987/1014 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2076 event pairs, 41 based on Foata normal form. 38/477 useless extension candidates. Maximal degree in co-relation 1674. Up to 195 conditions per place. [2023-11-12 02:11:36,351 INFO L140 encePairwiseOnDemand]: 162/169 looper letters, 32 selfloop transitions, 8 changer transitions 11/54 dead transitions. [2023-11-12 02:11:36,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 387 flow [2023-11-12 02:11:36,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:11:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:11:36,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 457 transitions. [2023-11-12 02:11:36,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45069033530571995 [2023-11-12 02:11:36,354 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 457 transitions. [2023-11-12 02:11:36,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 457 transitions. [2023-11-12 02:11:36,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:11:36,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 457 transitions. [2023-11-12 02:11:36,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 76.16666666666667) internal successors, (457), 6 states have internal predecessors, (457), 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-12 02:11:36,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 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-12 02:11:36,361 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 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-12 02:11:36,361 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 168 flow. Second operand 6 states and 457 transitions. [2023-11-12 02:11:36,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 387 flow [2023-11-12 02:11:36,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 381 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-12 02:11:36,369 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 210 flow [2023-11-12 02:11:36,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-11-12 02:11:36,370 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 17 predicate places. [2023-11-12 02:11:36,370 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 210 flow [2023-11-12 02:11:36,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 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-12 02:11:36,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:11:36,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:11:36,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:11:36,372 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:11:36,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:11:36,372 INFO L85 PathProgramCache]: Analyzing trace with hash 2128332358, now seen corresponding path program 1 times [2023-11-12 02:11:36,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:11:36,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512305019] [2023-11-12 02:11:36,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:11:36,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:11:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:11:37,063 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-12 02:11:37,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:11:37,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512305019] [2023-11-12 02:11:37,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512305019] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:11:37,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:11:37,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:11:37,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634518134] [2023-11-12 02:11:37,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:11:37,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:11:37,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:11:37,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:11:37,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:11:37,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2023-11-12 02:11:37,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 73.66666666666667) internal successors, (442), 6 states have internal predecessors, (442), 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-12 02:11:37,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:11:37,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2023-11-12 02:11:37,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:11:37,376 INFO L124 PetriNetUnfolderBase]: 219/430 cut-off events. [2023-11-12 02:11:37,376 INFO L125 PetriNetUnfolderBase]: For 1449/1465 co-relation queries the response was YES. [2023-11-12 02:11:37,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1731 conditions, 430 events. 219/430 cut-off events. For 1449/1465 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1915 event pairs, 96 based on Foata normal form. 42/472 useless extension candidates. Maximal degree in co-relation 1706. Up to 335 conditions per place. [2023-11-12 02:11:37,381 INFO L140 encePairwiseOnDemand]: 163/169 looper letters, 31 selfloop transitions, 10 changer transitions 11/54 dead transitions. [2023-11-12 02:11:37,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 442 flow [2023-11-12 02:11:37,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:11:37,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:11:37,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 471 transitions. [2023-11-12 02:11:37,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46449704142011833 [2023-11-12 02:11:37,385 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 471 transitions. [2023-11-12 02:11:37,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 471 transitions. [2023-11-12 02:11:37,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:11:37,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 471 transitions. [2023-11-12 02:11:37,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 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-12 02:11:37,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 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-12 02:11:37,390 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 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-12 02:11:37,391 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 210 flow. Second operand 6 states and 471 transitions. [2023-11-12 02:11:37,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 442 flow [2023-11-12 02:11:37,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 425 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-12 02:11:37,400 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 261 flow [2023-11-12 02:11:37,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=261, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2023-11-12 02:11:37,401 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 20 predicate places. [2023-11-12 02:11:37,401 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 261 flow [2023-11-12 02:11:37,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.66666666666667) internal successors, (442), 6 states have internal predecessors, (442), 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-12 02:11:37,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:11:37,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:11:37,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:11:37,402 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:11:37,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:11:37,403 INFO L85 PathProgramCache]: Analyzing trace with hash 895317464, now seen corresponding path program 1 times [2023-11-12 02:11:37,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:11:37,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163030402] [2023-11-12 02:11:37,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:11:37,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:11:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:11:37,728 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-12 02:11:37,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:11:37,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163030402] [2023-11-12 02:11:37,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163030402] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:11:37,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:11:37,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:11:37,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145657534] [2023-11-12 02:11:37,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:11:37,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:11:37,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:11:37,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:11:37,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:11:37,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2023-11-12 02:11:37,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 261 flow. Second operand has 6 states, 6 states have (on average 73.66666666666667) internal successors, (442), 6 states have internal predecessors, (442), 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-12 02:11:37,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:11:37,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2023-11-12 02:11:37,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:11:37,981 INFO L124 PetriNetUnfolderBase]: 214/415 cut-off events. [2023-11-12 02:11:37,981 INFO L125 PetriNetUnfolderBase]: For 1713/1722 co-relation queries the response was YES. [2023-11-12 02:11:37,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1866 conditions, 415 events. 214/415 cut-off events. For 1713/1722 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1790 event pairs, 90 based on Foata normal form. 23/438 useless extension candidates. Maximal degree in co-relation 1839. Up to 338 conditions per place. [2023-11-12 02:11:37,987 INFO L140 encePairwiseOnDemand]: 162/169 looper letters, 37 selfloop transitions, 8 changer transitions 10/57 dead transitions. [2023-11-12 02:11:37,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 57 transitions, 518 flow [2023-11-12 02:11:37,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:11:37,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:11:37,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 471 transitions. [2023-11-12 02:11:37,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46449704142011833 [2023-11-12 02:11:37,990 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 471 transitions. [2023-11-12 02:11:37,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 471 transitions. [2023-11-12 02:11:37,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:11:37,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 471 transitions. [2023-11-12 02:11:37,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 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-12 02:11:37,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 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-12 02:11:37,996 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 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-12 02:11:37,996 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 261 flow. Second operand 6 states and 471 transitions. [2023-11-12 02:11:37,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 57 transitions, 518 flow [2023-11-12 02:11:38,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 498 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-12 02:11:38,004 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 293 flow [2023-11-12 02:11:38,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-11-12 02:11:38,005 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2023-11-12 02:11:38,006 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 293 flow [2023-11-12 02:11:38,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.66666666666667) internal successors, (442), 6 states have internal predecessors, (442), 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-12 02:11:38,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:11:38,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:11:38,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:11:38,007 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:11:38,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:11:38,007 INFO L85 PathProgramCache]: Analyzing trace with hash 893674154, now seen corresponding path program 2 times [2023-11-12 02:11:38,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:11:38,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560645673] [2023-11-12 02:11:38,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:11:38,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:11:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:11:38,398 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-12 02:11:38,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:11:38,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560645673] [2023-11-12 02:11:38,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560645673] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:11:38,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:11:38,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:11:38,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982878323] [2023-11-12 02:11:38,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:11:38,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:11:38,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:11:38,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:11:38,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:11:38,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2023-11-12 02:11:38,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 293 flow. Second operand has 6 states, 6 states have (on average 73.66666666666667) internal successors, (442), 6 states have internal predecessors, (442), 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-12 02:11:38,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:11:38,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2023-11-12 02:11:38,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:11:38,653 INFO L124 PetriNetUnfolderBase]: 206/401 cut-off events. [2023-11-12 02:11:38,653 INFO L125 PetriNetUnfolderBase]: For 2059/2068 co-relation queries the response was YES. [2023-11-12 02:11:38,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1909 conditions, 401 events. 206/401 cut-off events. For 2059/2068 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1700 event pairs, 84 based on Foata normal form. 23/424 useless extension candidates. Maximal degree in co-relation 1880. Up to 332 conditions per place. [2023-11-12 02:11:38,658 INFO L140 encePairwiseOnDemand]: 162/169 looper letters, 35 selfloop transitions, 8 changer transitions 10/55 dead transitions. [2023-11-12 02:11:38,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 55 transitions, 512 flow [2023-11-12 02:11:38,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:11:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:11:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 469 transitions. [2023-11-12 02:11:38,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625246548323471 [2023-11-12 02:11:38,661 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 469 transitions. [2023-11-12 02:11:38,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 469 transitions. [2023-11-12 02:11:38,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:11:38,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 469 transitions. [2023-11-12 02:11:38,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 78.16666666666667) internal successors, (469), 6 states have internal predecessors, (469), 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-12 02:11:38,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 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-12 02:11:38,666 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 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-12 02:11:38,667 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 293 flow. Second operand 6 states and 469 transitions. [2023-11-12 02:11:38,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 55 transitions, 512 flow [2023-11-12 02:11:38,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 478 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-12 02:11:38,675 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 293 flow [2023-11-12 02:11:38,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-11-12 02:11:38,676 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 25 predicate places. [2023-11-12 02:11:38,676 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 293 flow [2023-11-12 02:11:38,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.66666666666667) internal successors, (442), 6 states have internal predecessors, (442), 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-12 02:11:38,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:11:38,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:11:38,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:11:38,678 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:11:38,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:11:38,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1553774063, now seen corresponding path program 1 times [2023-11-12 02:11:38,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:11:38,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967459349] [2023-11-12 02:11:38,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:11:38,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:11:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:11:39,477 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-12 02:11:39,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:11:39,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967459349] [2023-11-12 02:11:39,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967459349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:11:39,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:11:39,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:11:39,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320454631] [2023-11-12 02:11:39,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:11:39,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:11:39,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:11:39,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:11:39,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:11:39,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 169 [2023-11-12 02:11:39,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 293 flow. Second operand has 7 states, 7 states have (on average 69.57142857142857) internal successors, (487), 7 states have internal predecessors, (487), 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-12 02:11:39,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:11:39,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 169 [2023-11-12 02:11:39,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:11:39,911 INFO L124 PetriNetUnfolderBase]: 231/453 cut-off events. [2023-11-12 02:11:39,911 INFO L125 PetriNetUnfolderBase]: For 2260/2270 co-relation queries the response was YES. [2023-11-12 02:11:39,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2101 conditions, 453 events. 231/453 cut-off events. For 2260/2270 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2038 event pairs, 69 based on Foata normal form. 32/485 useless extension candidates. Maximal degree in co-relation 2071. Up to 323 conditions per place. [2023-11-12 02:11:39,916 INFO L140 encePairwiseOnDemand]: 162/169 looper letters, 38 selfloop transitions, 10 changer transitions 13/63 dead transitions. [2023-11-12 02:11:39,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 603 flow [2023-11-12 02:11:39,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:11:39,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:11:39,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 515 transitions. [2023-11-12 02:11:39,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4353338968723584 [2023-11-12 02:11:39,923 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 515 transitions. [2023-11-12 02:11:39,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 515 transitions. [2023-11-12 02:11:39,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:11:39,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 515 transitions. [2023-11-12 02:11:39,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 73.57142857142857) internal successors, (515), 7 states have internal predecessors, (515), 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-12 02:11:39,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 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-12 02:11:39,929 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 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-12 02:11:39,930 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 293 flow. Second operand 7 states and 515 transitions. [2023-11-12 02:11:39,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 603 flow [2023-11-12 02:11:39,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 571 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-12 02:11:39,937 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 336 flow [2023-11-12 02:11:39,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=336, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-11-12 02:11:39,940 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2023-11-12 02:11:39,940 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 336 flow [2023-11-12 02:11:39,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 69.57142857142857) internal successors, (487), 7 states have internal predecessors, (487), 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-12 02:11:39,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:11:39,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:11:39,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:11:39,941 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:11:39,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:11:39,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1985060297, now seen corresponding path program 2 times [2023-11-12 02:11:39,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:11:39,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037870837] [2023-11-12 02:11:39,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:11:39,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:11:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:11:40,294 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-12 02:11:40,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:11:40,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037870837] [2023-11-12 02:11:40,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037870837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:11:40,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:11:40,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:11:40,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99708860] [2023-11-12 02:11:40,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:11:40,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:11:40,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:11:40,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:11:40,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:11:40,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 169 [2023-11-12 02:11:40,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 336 flow. Second operand has 7 states, 7 states have (on average 72.57142857142857) internal successors, (508), 7 states have internal predecessors, (508), 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-12 02:11:40,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:11:40,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 169 [2023-11-12 02:11:40,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:11:40,668 INFO L124 PetriNetUnfolderBase]: 223/441 cut-off events. [2023-11-12 02:11:40,668 INFO L125 PetriNetUnfolderBase]: For 2531/2543 co-relation queries the response was YES. [2023-11-12 02:11:40,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2252 conditions, 441 events. 223/441 cut-off events. For 2531/2543 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1973 event pairs, 103 based on Foata normal form. 22/462 useless extension candidates. Maximal degree in co-relation 2222. Up to 354 conditions per place. [2023-11-12 02:11:40,674 INFO L140 encePairwiseOnDemand]: 161/169 looper letters, 33 selfloop transitions, 13 changer transitions 11/59 dead transitions. [2023-11-12 02:11:40,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 649 flow [2023-11-12 02:11:40,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:11:40,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:11:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 532 transitions. [2023-11-12 02:11:40,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44970414201183434 [2023-11-12 02:11:40,678 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 532 transitions. [2023-11-12 02:11:40,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 532 transitions. [2023-11-12 02:11:40,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:11:40,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 532 transitions. [2023-11-12 02:11:40,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 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-12 02:11:40,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 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-12 02:11:40,685 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 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-12 02:11:40,685 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 336 flow. Second operand 7 states and 532 transitions. [2023-11-12 02:11:40,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 649 flow [2023-11-12 02:11:40,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 635 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-12 02:11:40,696 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 445 flow [2023-11-12 02:11:40,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=445, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2023-11-12 02:11:40,697 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 31 predicate places. [2023-11-12 02:11:40,697 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 445 flow [2023-11-12 02:11:40,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 72.57142857142857) internal successors, (508), 7 states have internal predecessors, (508), 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-12 02:11:40,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:11:40,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:11:40,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:11:40,699 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:11:40,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:11:40,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1933742897, now seen corresponding path program 3 times [2023-11-12 02:11:40,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:11:40,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929129983] [2023-11-12 02:11:40,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:11:40,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:11:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:11:41,189 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-12 02:11:41,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:11:41,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929129983] [2023-11-12 02:11:41,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929129983] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:11:41,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:11:41,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:11:41,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729161092] [2023-11-12 02:11:41,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:11:41,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:11:41,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:11:41,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:11:41,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:11:41,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2023-11-12 02:11:41,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 445 flow. Second operand has 7 states, 7 states have (on average 73.57142857142857) internal successors, (515), 7 states have internal predecessors, (515), 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-12 02:11:41,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:11:41,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2023-11-12 02:11:41,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:11:41,524 INFO L124 PetriNetUnfolderBase]: 207/421 cut-off events. [2023-11-12 02:11:41,524 INFO L125 PetriNetUnfolderBase]: For 3222/3232 co-relation queries the response was YES. [2023-11-12 02:11:41,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2409 conditions, 421 events. 207/421 cut-off events. For 3222/3232 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1897 event pairs, 80 based on Foata normal form. 21/442 useless extension candidates. Maximal degree in co-relation 2376. Up to 349 conditions per place. [2023-11-12 02:11:41,530 INFO L140 encePairwiseOnDemand]: 161/169 looper letters, 42 selfloop transitions, 10 changer transitions 11/65 dead transitions. [2023-11-12 02:11:41,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 65 transitions, 791 flow [2023-11-12 02:11:41,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:11:41,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:11:41,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 544 transitions. [2023-11-12 02:11:41,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45984784446322907 [2023-11-12 02:11:41,533 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 544 transitions. [2023-11-12 02:11:41,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 544 transitions. [2023-11-12 02:11:41,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:11:41,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 544 transitions. [2023-11-12 02:11:41,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 77.71428571428571) internal successors, (544), 7 states have internal predecessors, (544), 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-12 02:11:41,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 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-12 02:11:41,539 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 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-12 02:11:41,539 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 445 flow. Second operand 7 states and 544 transitions. [2023-11-12 02:11:41,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 65 transitions, 791 flow [2023-11-12 02:11:41,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 65 transitions, 742 flow, removed 24 selfloop flow, removed 3 redundant places. [2023-11-12 02:11:41,553 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 469 flow [2023-11-12 02:11:41,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=469, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2023-11-12 02:11:41,554 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 35 predicate places. [2023-11-12 02:11:41,554 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 469 flow [2023-11-12 02:11:41,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.57142857142857) internal successors, (515), 7 states have internal predecessors, (515), 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-12 02:11:41,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:11:41,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:11:41,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:11:41,556 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:11:41,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:11:41,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1934117687, now seen corresponding path program 4 times [2023-11-12 02:11:41,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:11:41,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053078762] [2023-11-12 02:11:41,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:11:41,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:11:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:11:42,012 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-12 02:11:42,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:11:42,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053078762] [2023-11-12 02:11:42,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053078762] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:11:42,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:11:42,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:11:42,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977252049] [2023-11-12 02:11:42,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:11:42,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:11:42,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:11:42,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:11:42,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:11:42,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2023-11-12 02:11:42,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 469 flow. Second operand has 7 states, 7 states have (on average 73.57142857142857) internal successors, (515), 7 states have internal predecessors, (515), 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-12 02:11:42,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:11:42,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2023-11-12 02:11:42,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:11:42,421 INFO L124 PetriNetUnfolderBase]: 201/420 cut-off events. [2023-11-12 02:11:42,421 INFO L125 PetriNetUnfolderBase]: For 3694/3703 co-relation queries the response was YES. [2023-11-12 02:11:42,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2424 conditions, 420 events. 201/420 cut-off events. For 3694/3703 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1937 event pairs, 74 based on Foata normal form. 22/442 useless extension candidates. Maximal degree in co-relation 2389. Up to 282 conditions per place. [2023-11-12 02:11:42,426 INFO L140 encePairwiseOnDemand]: 162/169 looper letters, 37 selfloop transitions, 19 changer transitions 21/79 dead transitions. [2023-11-12 02:11:42,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 79 transitions, 987 flow [2023-11-12 02:11:42,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 02:11:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-12 02:11:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 699 transitions. [2023-11-12 02:11:42,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45956607495069035 [2023-11-12 02:11:42,431 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 699 transitions. [2023-11-12 02:11:42,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 699 transitions. [2023-11-12 02:11:42,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:11:42,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 699 transitions. [2023-11-12 02:11:42,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 77.66666666666667) internal successors, (699), 9 states have internal predecessors, (699), 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-12 02:11:42,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 169.0) internal successors, (1690), 10 states have internal predecessors, (1690), 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-12 02:11:42,438 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 169.0) internal successors, (1690), 10 states have internal predecessors, (1690), 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-12 02:11:42,438 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 469 flow. Second operand 9 states and 699 transitions. [2023-11-12 02:11:42,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 79 transitions, 987 flow [2023-11-12 02:11:42,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 79 transitions, 896 flow, removed 36 selfloop flow, removed 5 redundant places. [2023-11-12 02:11:42,460 INFO L231 Difference]: Finished difference. Result has 68 places, 46 transitions, 533 flow [2023-11-12 02:11:42,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=533, PETRI_PLACES=68, PETRI_TRANSITIONS=46} [2023-11-12 02:11:42,461 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 42 predicate places. [2023-11-12 02:11:42,461 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 46 transitions, 533 flow [2023-11-12 02:11:42,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.57142857142857) internal successors, (515), 7 states have internal predecessors, (515), 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-12 02:11:42,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:11:42,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:11:42,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:11:42,463 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:11:42,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:11:42,463 INFO L85 PathProgramCache]: Analyzing trace with hash -136977081, now seen corresponding path program 1 times [2023-11-12 02:11:42,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:11:42,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965670284] [2023-11-12 02:11:42,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:11:42,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:11:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:11:42,616 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-12 02:11:42,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:11:42,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965670284] [2023-11-12 02:11:42,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965670284] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:11:42,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:11:42,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:11:42,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839738705] [2023-11-12 02:11:42,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:11:42,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:11:42,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:11:42,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:11:42,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:11:42,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 169 [2023-11-12 02:11:42,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 46 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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-12 02:11:42,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:11:42,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 169 [2023-11-12 02:11:42,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:11:42,709 INFO L124 PetriNetUnfolderBase]: 55/150 cut-off events. [2023-11-12 02:11:42,709 INFO L125 PetriNetUnfolderBase]: For 1768/1777 co-relation queries the response was YES. [2023-11-12 02:11:42,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 979 conditions, 150 events. 55/150 cut-off events. For 1768/1777 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 550 event pairs, 19 based on Foata normal form. 22/171 useless extension candidates. Maximal degree in co-relation 940. Up to 104 conditions per place. [2023-11-12 02:11:42,712 INFO L140 encePairwiseOnDemand]: 165/169 looper letters, 33 selfloop transitions, 3 changer transitions 1/42 dead transitions. [2023-11-12 02:11:42,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 42 transitions, 555 flow [2023-11-12 02:11:42,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:11:42,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:11:42,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2023-11-12 02:11:42,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2023-11-12 02:11:42,715 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 247 transitions. [2023-11-12 02:11:42,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 247 transitions. [2023-11-12 02:11:42,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:11:42,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 247 transitions. [2023-11-12 02:11:42,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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-12 02:11:42,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:11:42,718 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:11:42,718 INFO L175 Difference]: Start difference. First operand has 68 places, 46 transitions, 533 flow. Second operand 3 states and 247 transitions. [2023-11-12 02:11:42,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 42 transitions, 555 flow [2023-11-12 02:11:42,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 452 flow, removed 26 selfloop flow, removed 17 redundant places. [2023-11-12 02:11:42,726 INFO L231 Difference]: Finished difference. Result has 51 places, 35 transitions, 318 flow [2023-11-12 02:11:42,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2023-11-12 02:11:42,728 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 25 predicate places. [2023-11-12 02:11:42,728 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 318 flow [2023-11-12 02:11:42,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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-12 02:11:42,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:11:42,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:11:42,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:11:42,729 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:11:42,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:11:42,730 INFO L85 PathProgramCache]: Analyzing trace with hash 643752547, now seen corresponding path program 1 times [2023-11-12 02:11:42,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:11:42,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173493721] [2023-11-12 02:11:42,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:11:42,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:11:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:11:42,898 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-12 02:11:42,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:11:42,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173493721] [2023-11-12 02:11:42,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173493721] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:11:42,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:11:42,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:11:42,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36490288] [2023-11-12 02:11:42,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:11:42,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:11:42,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:11:42,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:11:42,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:11:42,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 169 [2023-11-12 02:11:42,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 318 flow. Second operand has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 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-12 02:11:42,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:11:42,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 169 [2023-11-12 02:11:42,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:11:42,984 INFO L124 PetriNetUnfolderBase]: 20/71 cut-off events. [2023-11-12 02:11:42,984 INFO L125 PetriNetUnfolderBase]: For 347/350 co-relation queries the response was YES. [2023-11-12 02:11:42,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 71 events. 20/71 cut-off events. For 347/350 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 200 event pairs, 4 based on Foata normal form. 12/82 useless extension candidates. Maximal degree in co-relation 366. Up to 31 conditions per place. [2023-11-12 02:11:42,986 INFO L140 encePairwiseOnDemand]: 165/169 looper letters, 23 selfloop transitions, 5 changer transitions 9/40 dead transitions. [2023-11-12 02:11:42,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 40 transitions, 439 flow [2023-11-12 02:11:42,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:11:42,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:11:42,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 322 transitions. [2023-11-12 02:11:42,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47633136094674555 [2023-11-12 02:11:42,988 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 322 transitions. [2023-11-12 02:11:42,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 322 transitions. [2023-11-12 02:11:42,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:11:42,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 322 transitions. [2023-11-12 02:11:42,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 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-12 02:11:43,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 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-12 02:11:43,014 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 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-12 02:11:43,014 INFO L175 Difference]: Start difference. First operand has 51 places, 35 transitions, 318 flow. Second operand 4 states and 322 transitions. [2023-11-12 02:11:43,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 40 transitions, 439 flow [2023-11-12 02:11:43,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 40 transitions, 347 flow, removed 32 selfloop flow, removed 7 redundant places. [2023-11-12 02:11:43,018 INFO L231 Difference]: Finished difference. Result has 48 places, 25 transitions, 177 flow [2023-11-12 02:11:43,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=48, PETRI_TRANSITIONS=25} [2023-11-12 02:11:43,019 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 22 predicate places. [2023-11-12 02:11:43,019 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 25 transitions, 177 flow [2023-11-12 02:11:43,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 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-12 02:11:43,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:11:43,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:11:43,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 02:11:43,020 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:11:43,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:11:43,021 INFO L85 PathProgramCache]: Analyzing trace with hash 201034960, now seen corresponding path program 1 times [2023-11-12 02:11:43,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:11:43,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139405960] [2023-11-12 02:11:43,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:11:43,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:11:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:11:44,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:11:44,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:11:44,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139405960] [2023-11-12 02:11:44,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139405960] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:11:44,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:11:44,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:11:44,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513896465] [2023-11-12 02:11:44,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:11:44,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:11:44,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:11:44,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:11:44,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:11:44,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 169 [2023-11-12 02:11:44,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 25 transitions, 177 flow. Second operand has 9 states, 9 states have (on average 71.66666666666667) internal successors, (645), 9 states have internal predecessors, (645), 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-12 02:11:44,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:11:44,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 169 [2023-11-12 02:11:44,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:11:44,553 INFO L124 PetriNetUnfolderBase]: 15/56 cut-off events. [2023-11-12 02:11:44,553 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2023-11-12 02:11:44,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 56 events. 15/56 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 104 event pairs, 1 based on Foata normal form. 1/57 useless extension candidates. Maximal degree in co-relation 237. Up to 28 conditions per place. [2023-11-12 02:11:44,554 INFO L140 encePairwiseOnDemand]: 163/169 looper letters, 18 selfloop transitions, 4 changer transitions 14/37 dead transitions. [2023-11-12 02:11:44,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 37 transitions, 308 flow [2023-11-12 02:11:44,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:11:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:11:44,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 520 transitions. [2023-11-12 02:11:44,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43956043956043955 [2023-11-12 02:11:44,557 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 520 transitions. [2023-11-12 02:11:44,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 520 transitions. [2023-11-12 02:11:44,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:11:44,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 520 transitions. [2023-11-12 02:11:44,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 74.28571428571429) internal successors, (520), 7 states have internal predecessors, (520), 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-12 02:11:44,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 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-12 02:11:44,563 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 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-12 02:11:44,563 INFO L175 Difference]: Start difference. First operand has 48 places, 25 transitions, 177 flow. Second operand 7 states and 520 transitions. [2023-11-12 02:11:44,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 37 transitions, 308 flow [2023-11-12 02:11:44,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 252 flow, removed 12 selfloop flow, removed 10 redundant places. [2023-11-12 02:11:44,566 INFO L231 Difference]: Finished difference. Result has 44 places, 20 transitions, 110 flow [2023-11-12 02:11:44,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=44, PETRI_TRANSITIONS=20} [2023-11-12 02:11:44,567 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 18 predicate places. [2023-11-12 02:11:44,567 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 20 transitions, 110 flow [2023-11-12 02:11:44,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 71.66666666666667) internal successors, (645), 9 states have internal predecessors, (645), 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-12 02:11:44,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:11:44,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:11:44,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 02:11:44,569 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:11:44,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:11:44,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1416689532, now seen corresponding path program 2 times [2023-11-12 02:11:44,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:11:44,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022239576] [2023-11-12 02:11:44,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:11:44,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:11:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:11:44,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:11:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:11:44,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:11:44,713 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:11:44,714 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-12 02:11:44,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-12 02:11:44,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-12 02:11:44,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-12 02:11:44,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-12 02:11:44,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 02:11:44,718 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:11:44,725 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 02:11:44,725 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:11:44,781 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-12 02:11:44,784 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:11:44,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:11:44 BasicIcfg [2023-11-12 02:11:44,806 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:11:44,806 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:11:44,807 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:11:44,807 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:11:44,807 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:11:27" (3/4) ... [2023-11-12 02:11:44,808 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-12 02:11:44,828 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-12 02:11:44,829 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:11:44,905 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4700705-3578-434f-b80e-4adc7d44669c/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:11:44,905 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:11:44,906 INFO L158 Benchmark]: Toolchain (without parser) took 18998.62ms. Allocated memory was 134.2MB in the beginning and 329.3MB in the end (delta: 195.0MB). Free memory was 87.7MB in the beginning and 116.7MB in the end (delta: -29.0MB). Peak memory consumption was 168.5MB. Max. memory is 16.1GB. [2023-11-12 02:11:44,906 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 134.2MB. Free memory is still 103.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:11:44,906 INFO L158 Benchmark]: CACSL2BoogieTranslator took 720.27ms. Allocated memory is still 134.2MB. Free memory was 87.2MB in the beginning and 64.7MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-12 02:11:44,907 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.57ms. Allocated memory is still 134.2MB. Free memory was 64.7MB in the beginning and 62.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:11:44,907 INFO L158 Benchmark]: Boogie Preprocessor took 73.83ms. Allocated memory is still 134.2MB. Free memory was 62.1MB in the beginning and 60.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:11:44,908 INFO L158 Benchmark]: RCFGBuilder took 878.37ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 60.5MB in the beginning and 139.4MB in the end (delta: -78.9MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2023-11-12 02:11:44,908 INFO L158 Benchmark]: TraceAbstraction took 17111.46ms. Allocated memory was 188.7MB in the beginning and 329.3MB in the end (delta: 140.5MB). Free memory was 138.4MB in the beginning and 123.0MB in the end (delta: 15.5MB). Peak memory consumption was 157.0MB. Max. memory is 16.1GB. [2023-11-12 02:11:44,908 INFO L158 Benchmark]: Witness Printer took 98.73ms. Allocated memory is still 329.3MB. Free memory was 123.0MB in the beginning and 116.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-12 02:11:44,911 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 134.2MB. Free memory is still 103.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 720.27ms. Allocated memory is still 134.2MB. Free memory was 87.2MB in the beginning and 64.7MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.57ms. Allocated memory is still 134.2MB. Free memory was 64.7MB in the beginning and 62.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.83ms. Allocated memory is still 134.2MB. Free memory was 62.1MB in the beginning and 60.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 878.37ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 60.5MB in the beginning and 139.4MB in the end (delta: -78.9MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17111.46ms. Allocated memory was 188.7MB in the beginning and 329.3MB in the end (delta: 140.5MB). Free memory was 138.4MB in the beginning and 123.0MB in the end (delta: 15.5MB). Peak memory consumption was 157.0MB. Max. memory is 16.1GB. * Witness Printer took 98.73ms. Allocated memory is still 329.3MB. Free memory was 123.0MB in the beginning and 116.7MB 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: 3.8s, 92 PlacesBefore, 26 PlacesAfterwards, 87 TransitionsBefore, 20 TransitionsAfterwards, 1154 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 80 TotalNumberOfCompositions, 3018 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1347, independent: 1222, independent conditional: 0, independent unconditional: 1222, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 630, independent: 609, independent conditional: 0, independent unconditional: 609, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1347, independent: 613, independent conditional: 0, independent unconditional: 613, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 630, unknown conditional: 0, unknown unconditional: 630] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2473; [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L792] 0 pthread_t t2474; [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 [L821] 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, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 791]: 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, 107 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: 16.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 582 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 409 mSDsluCounter, 568 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 466 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1580 IncrementalHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 102 mSDtfsCounter, 1580 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=533occurred in iteration=11, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 1700 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-12 02:11:44,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4700705-3578-434f-b80e-4adc7d44669c/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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