./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e64f9d8-329c-4719-ba30-67597a1d4371/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e64f9d8-329c-4719-ba30-67597a1d4371/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e64f9d8-329c-4719-ba30-67597a1d4371/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e64f9d8-329c-4719-ba30-67597a1d4371/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e64f9d8-329c-4719-ba30-67597a1d4371/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e64f9d8-329c-4719-ba30-67597a1d4371/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11eadb3d3dbb959cb5d260936a4e759de0e9c0b331e2b23d922151dc0bfe3fa5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:43:04,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:43:04,950 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e64f9d8-329c-4719-ba30-67597a1d4371/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:43:04,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:43:04,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:43:04,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:43:05,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:43:05,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:43:05,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:43:05,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:43:05,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:43:05,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:43:05,005 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:43:05,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:43:05,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:43:05,007 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:43:05,007 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:43:05,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:43:05,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:43:05,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:43:05,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:43:05,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:43:05,012 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:43:05,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:43:05,013 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:43:05,013 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:43:05,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:43:05,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:43:05,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:43:05,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:43:05,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:43:05,016 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:43:05,017 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:43:05,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:43:05,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:43:05,018 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:43:05,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:43:05,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:43:05,018 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:43:05,019 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_3e64f9d8-329c-4719-ba30-67597a1d4371/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e64f9d8-329c-4719-ba30-67597a1d4371/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11eadb3d3dbb959cb5d260936a4e759de0e9c0b331e2b23d922151dc0bfe3fa5 [2023-11-19 07:43:05,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:43:05,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:43:05,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:43:05,338 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:43:05,338 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:43:05,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e64f9d8-329c-4719-ba30-67597a1d4371/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 07:43:08,446 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:43:08,780 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:43:08,781 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e64f9d8-329c-4719-ba30-67597a1d4371/sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 07:43:08,804 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e64f9d8-329c-4719-ba30-67597a1d4371/bin/uautomizer-verify-uCwYo4JHxu/data/ddae6ee27/0d247036da8a4d538311114fafdbf09e/FLAGa44c51f05 [2023-11-19 07:43:08,820 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e64f9d8-329c-4719-ba30-67597a1d4371/bin/uautomizer-verify-uCwYo4JHxu/data/ddae6ee27/0d247036da8a4d538311114fafdbf09e [2023-11-19 07:43:08,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:43:08,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:43:08,826 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:43:08,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:43:08,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:43:08,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:43:08" (1/1) ... [2023-11-19 07:43:08,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a72baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:08, skipping insertion in model container [2023-11-19 07:43:08,835 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:43:08" (1/1) ... [2023-11-19 07:43:08,884 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:43:09,091 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_3e64f9d8-329c-4719-ba30-67597a1d4371/sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-11-19 07:43:09,321 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:43:09,339 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:43:09,359 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_3e64f9d8-329c-4719-ba30-67597a1d4371/sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-11-19 07:43:09,434 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:43:09,482 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:43:09,483 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:43:09,491 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:43:09,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09 WrapperNode [2023-11-19 07:43:09,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:43:09,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:43:09,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:43:09,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:43:09,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:09,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:09,585 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2023-11-19 07:43:09,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:43:09,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:43:09,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:43:09,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:43:09,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:09,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:09,607 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:09,608 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:09,616 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:09,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:09,621 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:09,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:09,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:43:09,628 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:43:09,628 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:43:09,628 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:43:09,629 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (1/1) ... [2023-11-19 07:43:09,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:43:09,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e64f9d8-329c-4719-ba30-67597a1d4371/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:43:09,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e64f9d8-329c-4719-ba30-67597a1d4371/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:43:09,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e64f9d8-329c-4719-ba30-67597a1d4371/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:43:09,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:43:09,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:43:09,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:43:09,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:43:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:43:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:43:09,721 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:43:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:43:09,721 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:43:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:43:09,721 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:43:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:43:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:43:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:43:09,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:43:09,724 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:43:09,877 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:43:09,880 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:43:10,243 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:43:10,442 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:43:10,443 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:43:10,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:43:10 BoogieIcfgContainer [2023-11-19 07:43:10,447 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:43:10,472 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:43:10,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:43:10,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:43:10,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:43:08" (1/3) ... [2023-11-19 07:43:10,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c6da63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:43:10, skipping insertion in model container [2023-11-19 07:43:10,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:09" (2/3) ... [2023-11-19 07:43:10,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c6da63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:43:10, skipping insertion in model container [2023-11-19 07:43:10,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:43:10" (3/3) ... [2023-11-19 07:43:10,482 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 07:43:10,494 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:43:10,506 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:43:10,507 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 07:43:10,507 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:43:10,603 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:43:10,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 238 flow [2023-11-19 07:43:10,709 INFO L124 PetriNetUnfolderBase]: 2/110 cut-off events. [2023-11-19 07:43:10,709 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:43:10,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-11-19 07:43:10,715 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 238 flow [2023-11-19 07:43:10,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2023-11-19 07:43:10,724 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:43:10,736 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 110 transitions, 229 flow [2023-11-19 07:43:10,739 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 110 transitions, 229 flow [2023-11-19 07:43:10,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 229 flow [2023-11-19 07:43:10,772 INFO L124 PetriNetUnfolderBase]: 2/110 cut-off events. [2023-11-19 07:43:10,773 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:43:10,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-11-19 07:43:10,776 INFO L119 LiptonReduction]: Number of co-enabled transitions 2304 [2023-11-19 07:43:15,456 INFO L134 LiptonReduction]: Checked pairs total: 4151 [2023-11-19 07:43:15,456 INFO L136 LiptonReduction]: Total number of compositions: 102 [2023-11-19 07:43:15,473 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:43:15,480 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;@823ebb7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:43:15,481 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-19 07:43:15,487 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:43:15,488 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-11-19 07:43:15,488 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:43:15,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:15,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:15,489 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:43:15,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:15,495 INFO L85 PathProgramCache]: Analyzing trace with hash -538039341, now seen corresponding path program 1 times [2023-11-19 07:43:15,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:15,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598885759] [2023-11-19 07:43:15,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:15,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:16,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:43:16,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:16,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598885759] [2023-11-19 07:43:16,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598885759] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:16,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:16,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:43:16,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764951435] [2023-11-19 07:43:16,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:16,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:43:16,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:16,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:43:16,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:43:16,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 215 [2023-11-19 07:43:16,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:16,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:16,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 215 [2023-11-19 07:43:16,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:16,465 INFO L124 PetriNetUnfolderBase]: 711/1152 cut-off events. [2023-11-19 07:43:16,466 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-19 07:43:16,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2271 conditions, 1152 events. 711/1152 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5104 event pairs, 159 based on Foata normal form. 0/1088 useless extension candidates. Maximal degree in co-relation 2260. Up to 793 conditions per place. [2023-11-19 07:43:16,485 INFO L140 encePairwiseOnDemand]: 211/215 looper letters, 25 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2023-11-19 07:43:16,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 127 flow [2023-11-19 07:43:16,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:43:16,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:43:16,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2023-11-19 07:43:16,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5193798449612403 [2023-11-19 07:43:16,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2023-11-19 07:43:16,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2023-11-19 07:43:16,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:16,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2023-11-19 07:43:16,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:16,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:16,532 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:16,534 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 53 flow. Second operand 3 states and 335 transitions. [2023-11-19 07:43:16,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 127 flow [2023-11-19 07:43:16,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 07:43:16,541 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 48 flow [2023-11-19 07:43:16,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2023-11-19 07:43:16,550 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-11-19 07:43:16,551 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 48 flow [2023-11-19 07:43:16,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:16,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:16,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:16,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:43:16,553 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:43:16,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:16,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1659694803, now seen corresponding path program 1 times [2023-11-19 07:43:16,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:16,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384775312] [2023-11-19 07:43:16,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:16,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:43:16,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:16,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384775312] [2023-11-19 07:43:16,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384775312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:16,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:16,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:43:16,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122649674] [2023-11-19 07:43:16,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:16,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:43:16,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:16,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:43:16,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:43:16,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 215 [2023-11-19 07:43:16,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:16,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:16,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 215 [2023-11-19 07:43:16,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:16,998 INFO L124 PetriNetUnfolderBase]: 689/1042 cut-off events. [2023-11-19 07:43:16,998 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2023-11-19 07:43:17,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2190 conditions, 1042 events. 689/1042 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4087 event pairs, 185 based on Foata normal form. 8/1050 useless extension candidates. Maximal degree in co-relation 2180. Up to 979 conditions per place. [2023-11-19 07:43:17,007 INFO L140 encePairwiseOnDemand]: 211/215 looper letters, 28 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2023-11-19 07:43:17,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 31 transitions, 140 flow [2023-11-19 07:43:17,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:43:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:43:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-11-19 07:43:17,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5100775193798449 [2023-11-19 07:43:17,010 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-11-19 07:43:17,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-11-19 07:43:17,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:17,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-11-19 07:43:17,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:17,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:17,015 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:17,016 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 48 flow. Second operand 3 states and 329 transitions. [2023-11-19 07:43:17,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 31 transitions, 140 flow [2023-11-19 07:43:17,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:43:17,018 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 63 flow [2023-11-19 07:43:17,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2023-11-19 07:43:17,019 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-11-19 07:43:17,019 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 63 flow [2023-11-19 07:43:17,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:17,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:17,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:17,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:43:17,020 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:43:17,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:17,021 INFO L85 PathProgramCache]: Analyzing trace with hash 89067186, now seen corresponding path program 1 times [2023-11-19 07:43:17,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:17,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420520833] [2023-11-19 07:43:17,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:17,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:17,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:43:17,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:17,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420520833] [2023-11-19 07:43:17,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420520833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:17,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:17,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:43:17,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634274521] [2023-11-19 07:43:17,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:17,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:43:17,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:17,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:43:17,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:43:17,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 215 [2023-11-19 07:43:17,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 63 flow. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:17,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:17,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 215 [2023-11-19 07:43:17,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:17,465 INFO L124 PetriNetUnfolderBase]: 477/792 cut-off events. [2023-11-19 07:43:17,466 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-19 07:43:17,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1781 conditions, 792 events. 477/792 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3478 event pairs, 116 based on Foata normal form. 76/849 useless extension candidates. Maximal degree in co-relation 1770. Up to 325 conditions per place. [2023-11-19 07:43:17,472 INFO L140 encePairwiseOnDemand]: 209/215 looper letters, 38 selfloop transitions, 5 changer transitions 1/46 dead transitions. [2023-11-19 07:43:17,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 46 transitions, 215 flow [2023-11-19 07:43:17,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:43:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:43:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 427 transitions. [2023-11-19 07:43:17,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965116279069767 [2023-11-19 07:43:17,475 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 427 transitions. [2023-11-19 07:43:17,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 427 transitions. [2023-11-19 07:43:17,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:17,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 427 transitions. [2023-11-19 07:43:17,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:17,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:17,483 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:17,483 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 63 flow. Second operand 4 states and 427 transitions. [2023-11-19 07:43:17,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 46 transitions, 215 flow [2023-11-19 07:43:17,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 210 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:43:17,486 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 94 flow [2023-11-19 07:43:17,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2023-11-19 07:43:17,488 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2023-11-19 07:43:17,492 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 94 flow [2023-11-19 07:43:17,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:17,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:17,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:17,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:43:17,494 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:43:17,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:17,502 INFO L85 PathProgramCache]: Analyzing trace with hash -728003586, now seen corresponding path program 1 times [2023-11-19 07:43:17,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:17,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7626043] [2023-11-19 07:43:17,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:17,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:17,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:43:17,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:17,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7626043] [2023-11-19 07:43:17,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7626043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:17,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:17,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:43:17,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609454313] [2023-11-19 07:43:17,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:17,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:43:17,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:17,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:43:17,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:43:17,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 215 [2023-11-19 07:43:17,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:17,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:17,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 215 [2023-11-19 07:43:17,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:17,946 INFO L124 PetriNetUnfolderBase]: 230/420 cut-off events. [2023-11-19 07:43:17,947 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2023-11-19 07:43:17,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1184 conditions, 420 events. 230/420 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1614 event pairs, 56 based on Foata normal form. 40/458 useless extension candidates. Maximal degree in co-relation 1170. Up to 172 conditions per place. [2023-11-19 07:43:17,951 INFO L140 encePairwiseOnDemand]: 209/215 looper letters, 45 selfloop transitions, 8 changer transitions 1/56 dead transitions. [2023-11-19 07:43:17,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 56 transitions, 295 flow [2023-11-19 07:43:17,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:43:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:43:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2023-11-19 07:43:17,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4967441860465116 [2023-11-19 07:43:17,954 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 534 transitions. [2023-11-19 07:43:17,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 534 transitions. [2023-11-19 07:43:17,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:17,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 534 transitions. [2023-11-19 07:43:17,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:17,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:17,961 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:17,961 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 94 flow. Second operand 5 states and 534 transitions. [2023-11-19 07:43:17,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 56 transitions, 295 flow [2023-11-19 07:43:17,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 56 transitions, 285 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-19 07:43:17,965 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 134 flow [2023-11-19 07:43:17,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2023-11-19 07:43:17,966 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-11-19 07:43:17,966 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 134 flow [2023-11-19 07:43:17,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:17,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:17,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:17,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:43:17,968 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:43:17,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:17,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1825161703, now seen corresponding path program 1 times [2023-11-19 07:43:17,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:17,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272614873] [2023-11-19 07:43:17,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:17,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:43:18,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:18,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272614873] [2023-11-19 07:43:18,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272614873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:18,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:18,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:43:18,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587448606] [2023-11-19 07:43:18,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:18,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:43:18,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:18,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:43:18,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:43:18,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 215 [2023-11-19 07:43:18,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:18,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:18,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 215 [2023-11-19 07:43:18,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:18,360 INFO L124 PetriNetUnfolderBase]: 150/281 cut-off events. [2023-11-19 07:43:18,360 INFO L125 PetriNetUnfolderBase]: For 275/275 co-relation queries the response was YES. [2023-11-19 07:43:18,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 281 events. 150/281 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 955 event pairs, 53 based on Foata normal form. 11/291 useless extension candidates. Maximal degree in co-relation 859. Up to 111 conditions per place. [2023-11-19 07:43:18,363 INFO L140 encePairwiseOnDemand]: 209/215 looper letters, 33 selfloop transitions, 11 changer transitions 1/47 dead transitions. [2023-11-19 07:43:18,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 280 flow [2023-11-19 07:43:18,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:43:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:43:18,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 621 transitions. [2023-11-19 07:43:18,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4813953488372093 [2023-11-19 07:43:18,366 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 621 transitions. [2023-11-19 07:43:18,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 621 transitions. [2023-11-19 07:43:18,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:18,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 621 transitions. [2023-11-19 07:43:18,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:18,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:18,373 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:18,374 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 134 flow. Second operand 6 states and 621 transitions. [2023-11-19 07:43:18,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 280 flow [2023-11-19 07:43:18,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 253 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-19 07:43:18,378 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 146 flow [2023-11-19 07:43:18,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-11-19 07:43:18,379 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2023-11-19 07:43:18,380 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 146 flow [2023-11-19 07:43:18,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:18,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:18,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:18,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:43:18,381 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:43:18,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:18,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1849304683, now seen corresponding path program 1 times [2023-11-19 07:43:18,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:18,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120470897] [2023-11-19 07:43:18,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:18,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:43:18,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:18,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120470897] [2023-11-19 07:43:18,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120470897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:18,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:18,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:43:18,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131623816] [2023-11-19 07:43:18,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:18,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:43:18,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:18,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:43:18,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:43:18,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 215 [2023-11-19 07:43:18,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:18,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:18,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 215 [2023-11-19 07:43:18,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:18,785 INFO L124 PetriNetUnfolderBase]: 205/373 cut-off events. [2023-11-19 07:43:18,786 INFO L125 PetriNetUnfolderBase]: For 452/452 co-relation queries the response was YES. [2023-11-19 07:43:18,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1205 conditions, 373 events. 205/373 cut-off events. For 452/452 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1427 event pairs, 35 based on Foata normal form. 1/374 useless extension candidates. Maximal degree in co-relation 1188. Up to 274 conditions per place. [2023-11-19 07:43:18,790 INFO L140 encePairwiseOnDemand]: 209/215 looper letters, 38 selfloop transitions, 7 changer transitions 5/50 dead transitions. [2023-11-19 07:43:18,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 374 flow [2023-11-19 07:43:18,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:43:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:43:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-11-19 07:43:18,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023255813953489 [2023-11-19 07:43:18,793 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-11-19 07:43:18,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-11-19 07:43:18,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:18,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-11-19 07:43:18,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:18,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:18,797 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:18,797 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 146 flow. Second operand 3 states and 324 transitions. [2023-11-19 07:43:18,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 374 flow [2023-11-19 07:43:18,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 50 transitions, 261 flow, removed 20 selfloop flow, removed 9 redundant places. [2023-11-19 07:43:18,803 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 144 flow [2023-11-19 07:43:18,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2023-11-19 07:43:18,804 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-11-19 07:43:18,805 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 144 flow [2023-11-19 07:43:18,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:18,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:18,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:18,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:43:18,806 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:43:18,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:18,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1284273463, now seen corresponding path program 2 times [2023-11-19 07:43:18,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:18,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467712286] [2023-11-19 07:43:18,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:18,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:43:19,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:19,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467712286] [2023-11-19 07:43:19,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467712286] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:19,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:19,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:43:19,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439628640] [2023-11-19 07:43:19,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:19,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:43:19,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:19,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:43:19,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:43:19,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 215 [2023-11-19 07:43:19,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 144 flow. Second operand has 8 states, 8 states have (on average 92.375) internal successors, (739), 8 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:19,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:19,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 215 [2023-11-19 07:43:19,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:20,096 INFO L124 PetriNetUnfolderBase]: 294/545 cut-off events. [2023-11-19 07:43:20,096 INFO L125 PetriNetUnfolderBase]: For 443/443 co-relation queries the response was YES. [2023-11-19 07:43:20,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1665 conditions, 545 events. 294/545 cut-off events. For 443/443 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2331 event pairs, 12 based on Foata normal form. 1/546 useless extension candidates. Maximal degree in co-relation 1650. Up to 207 conditions per place. [2023-11-19 07:43:20,101 INFO L140 encePairwiseOnDemand]: 206/215 looper letters, 54 selfloop transitions, 30 changer transitions 45/129 dead transitions. [2023-11-19 07:43:20,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 129 transitions, 792 flow [2023-11-19 07:43:20,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:43:20,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-19 07:43:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1273 transitions. [2023-11-19 07:43:20,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4554561717352415 [2023-11-19 07:43:20,107 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1273 transitions. [2023-11-19 07:43:20,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1273 transitions. [2023-11-19 07:43:20,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:20,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1273 transitions. [2023-11-19 07:43:20,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 97.92307692307692) internal successors, (1273), 13 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:20,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 215.0) internal successors, (3010), 14 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:20,120 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 215.0) internal successors, (3010), 14 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:20,120 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 144 flow. Second operand 13 states and 1273 transitions. [2023-11-19 07:43:20,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 129 transitions, 792 flow [2023-11-19 07:43:20,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 129 transitions, 736 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:43:20,125 INFO L231 Difference]: Finished difference. Result has 52 places, 56 transitions, 335 flow [2023-11-19 07:43:20,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=335, PETRI_PLACES=52, PETRI_TRANSITIONS=56} [2023-11-19 07:43:20,126 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2023-11-19 07:43:20,127 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 56 transitions, 335 flow [2023-11-19 07:43:20,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.375) internal successors, (739), 8 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:20,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:20,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:20,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:43:20,128 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:43:20,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:20,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1735104325, now seen corresponding path program 3 times [2023-11-19 07:43:20,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:20,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910598505] [2023-11-19 07:43:20,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:20,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:20,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:43:20,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:20,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910598505] [2023-11-19 07:43:20,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910598505] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:20,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:20,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:43:20,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926116120] [2023-11-19 07:43:20,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:20,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:43:20,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:20,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:43:20,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:43:20,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 215 [2023-11-19 07:43:20,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 56 transitions, 335 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:20,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:20,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 215 [2023-11-19 07:43:20,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:20,639 INFO L124 PetriNetUnfolderBase]: 241/450 cut-off events. [2023-11-19 07:43:20,639 INFO L125 PetriNetUnfolderBase]: For 595/595 co-relation queries the response was YES. [2023-11-19 07:43:20,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1710 conditions, 450 events. 241/450 cut-off events. For 595/595 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1824 event pairs, 35 based on Foata normal form. 1/451 useless extension candidates. Maximal degree in co-relation 1694. Up to 247 conditions per place. [2023-11-19 07:43:20,671 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 47 selfloop transitions, 10 changer transitions 26/83 dead transitions. [2023-11-19 07:43:20,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 83 transitions, 626 flow [2023-11-19 07:43:20,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:43:20,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:43:20,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 423 transitions. [2023-11-19 07:43:20,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49186046511627907 [2023-11-19 07:43:20,675 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 423 transitions. [2023-11-19 07:43:20,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 423 transitions. [2023-11-19 07:43:20,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:20,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 423 transitions. [2023-11-19 07:43:20,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:20,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:20,682 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:20,682 INFO L175 Difference]: Start difference. First operand has 52 places, 56 transitions, 335 flow. Second operand 4 states and 423 transitions. [2023-11-19 07:43:20,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 83 transitions, 626 flow [2023-11-19 07:43:20,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 83 transitions, 606 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-11-19 07:43:20,689 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 283 flow [2023-11-19 07:43:20,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=283, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2023-11-19 07:43:20,694 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2023-11-19 07:43:20,694 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 283 flow [2023-11-19 07:43:20,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:20,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:20,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:20,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:43:20,697 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:43:20,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:20,697 INFO L85 PathProgramCache]: Analyzing trace with hash 207716925, now seen corresponding path program 4 times [2023-11-19 07:43:20,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:20,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061622967] [2023-11-19 07:43:20,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:20,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:43:21,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:21,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061622967] [2023-11-19 07:43:21,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061622967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:21,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:21,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:43:21,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760894040] [2023-11-19 07:43:21,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:21,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:43:21,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:21,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:43:21,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:43:21,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 215 [2023-11-19 07:43:21,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 283 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:21,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:21,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 215 [2023-11-19 07:43:21,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:21,161 INFO L124 PetriNetUnfolderBase]: 91/188 cut-off events. [2023-11-19 07:43:21,162 INFO L125 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2023-11-19 07:43:21,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 743 conditions, 188 events. 91/188 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 606 event pairs, 8 based on Foata normal form. 1/189 useless extension candidates. Maximal degree in co-relation 719. Up to 105 conditions per place. [2023-11-19 07:43:21,164 INFO L140 encePairwiseOnDemand]: 208/215 looper letters, 42 selfloop transitions, 12 changer transitions 20/74 dead transitions. [2023-11-19 07:43:21,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 74 transitions, 550 flow [2023-11-19 07:43:21,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:43:21,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:43:21,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2023-11-19 07:43:21,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4781395348837209 [2023-11-19 07:43:21,167 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 514 transitions. [2023-11-19 07:43:21,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 514 transitions. [2023-11-19 07:43:21,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:21,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 514 transitions. [2023-11-19 07:43:21,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:21,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:21,174 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:21,175 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 283 flow. Second operand 5 states and 514 transitions. [2023-11-19 07:43:21,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 74 transitions, 550 flow [2023-11-19 07:43:21,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 506 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-11-19 07:43:21,180 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 255 flow [2023-11-19 07:43:21,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=255, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-11-19 07:43:21,181 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 22 predicate places. [2023-11-19 07:43:21,181 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 255 flow [2023-11-19 07:43:21,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:21,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:21,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:21,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:43:21,182 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:43:21,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:21,183 INFO L85 PathProgramCache]: Analyzing trace with hash 289423237, now seen corresponding path program 5 times [2023-11-19 07:43:21,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:21,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737655463] [2023-11-19 07:43:21,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:21,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:43:21,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:21,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737655463] [2023-11-19 07:43:21,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737655463] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:21,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:21,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:43:21,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738910472] [2023-11-19 07:43:21,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:21,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:43:21,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:21,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:43:21,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:43:21,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 215 [2023-11-19 07:43:21,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:21,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:21,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 215 [2023-11-19 07:43:21,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:21,658 INFO L124 PetriNetUnfolderBase]: 67/154 cut-off events. [2023-11-19 07:43:21,659 INFO L125 PetriNetUnfolderBase]: For 332/332 co-relation queries the response was YES. [2023-11-19 07:43:21,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 154 events. 67/154 cut-off events. For 332/332 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 480 event pairs, 5 based on Foata normal form. 1/155 useless extension candidates. Maximal degree in co-relation 588. Up to 62 conditions per place. [2023-11-19 07:43:21,660 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 31 selfloop transitions, 5 changer transitions 27/63 dead transitions. [2023-11-19 07:43:21,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 63 transitions, 459 flow [2023-11-19 07:43:21,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:43:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:43:21,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions. [2023-11-19 07:43:21,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4689922480620155 [2023-11-19 07:43:21,665 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 605 transitions. [2023-11-19 07:43:21,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 605 transitions. [2023-11-19 07:43:21,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:21,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 605 transitions. [2023-11-19 07:43:21,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:21,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:21,673 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:21,674 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 255 flow. Second operand 6 states and 605 transitions. [2023-11-19 07:43:21,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 63 transitions, 459 flow [2023-11-19 07:43:21,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 433 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-19 07:43:21,680 INFO L231 Difference]: Finished difference. Result has 55 places, 31 transitions, 156 flow [2023-11-19 07:43:21,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=55, PETRI_TRANSITIONS=31} [2023-11-19 07:43:21,683 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2023-11-19 07:43:21,683 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 31 transitions, 156 flow [2023-11-19 07:43:21,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:21,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:21,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:21,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:43:21,684 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:43:21,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:21,685 INFO L85 PathProgramCache]: Analyzing trace with hash -828973339, now seen corresponding path program 6 times [2023-11-19 07:43:21,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:21,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078219495] [2023-11-19 07:43:21,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:21,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:43:22,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:22,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078219495] [2023-11-19 07:43:22,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078219495] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:22,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:22,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:43:22,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423636322] [2023-11-19 07:43:22,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:22,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:43:22,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:22,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:43:22,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:43:22,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 215 [2023-11-19 07:43:22,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 31 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:22,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:22,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 215 [2023-11-19 07:43:22,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:22,586 INFO L124 PetriNetUnfolderBase]: 37/100 cut-off events. [2023-11-19 07:43:22,586 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2023-11-19 07:43:22,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 100 events. 37/100 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 286 event pairs, 8 based on Foata normal form. 1/101 useless extension candidates. Maximal degree in co-relation 355. Up to 34 conditions per place. [2023-11-19 07:43:22,587 INFO L140 encePairwiseOnDemand]: 208/215 looper letters, 22 selfloop transitions, 4 changer transitions 22/48 dead transitions. [2023-11-19 07:43:22,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 318 flow [2023-11-19 07:43:22,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:43:22,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 07:43:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 770 transitions. [2023-11-19 07:43:22,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4476744186046512 [2023-11-19 07:43:22,592 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 770 transitions. [2023-11-19 07:43:22,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 770 transitions. [2023-11-19 07:43:22,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:22,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 770 transitions. [2023-11-19 07:43:22,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 96.25) internal successors, (770), 8 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:22,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:22,601 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:22,601 INFO L175 Difference]: Start difference. First operand has 55 places, 31 transitions, 156 flow. Second operand 8 states and 770 transitions. [2023-11-19 07:43:22,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 318 flow [2023-11-19 07:43:22,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 291 flow, removed 5 selfloop flow, removed 8 redundant places. [2023-11-19 07:43:22,604 INFO L231 Difference]: Finished difference. Result has 50 places, 25 transitions, 110 flow [2023-11-19 07:43:22,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=110, PETRI_PLACES=50, PETRI_TRANSITIONS=25} [2023-11-19 07:43:22,605 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 19 predicate places. [2023-11-19 07:43:22,606 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 25 transitions, 110 flow [2023-11-19 07:43:22,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:22,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:22,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:22,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:43:22,607 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:43:22,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:22,608 INFO L85 PathProgramCache]: Analyzing trace with hash 187050049, now seen corresponding path program 7 times [2023-11-19 07:43:22,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:22,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875074377] [2023-11-19 07:43:22,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:22,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:43:22,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:43:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:43:22,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:43:22,756 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:43:22,757 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-19 07:43:22,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-19 07:43:22,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-19 07:43:22,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-19 07:43:22,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-19 07:43:22,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-19 07:43:22,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:43:22,762 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1] [2023-11-19 07:43:22,770 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:43:22,771 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:43:22,844 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:43:22,847 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:43:22,850 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:43:22,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:43:22 BasicIcfg [2023-11-19 07:43:22,886 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:43:22,887 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:43:22,887 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:43:22,888 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:43:22,888 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:43:10" (3/4) ... [2023-11-19 07:43:22,889 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 07:43:22,925 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:43:22,929 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:43:22,932 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:43:23,010 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e64f9d8-329c-4719-ba30-67597a1d4371/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:43:23,010 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:43:23,011 INFO L158 Benchmark]: Toolchain (without parser) took 14186.00ms. Allocated memory was 159.4MB in the beginning and 260.0MB in the end (delta: 100.7MB). Free memory was 126.9MB in the beginning and 178.2MB in the end (delta: -51.3MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2023-11-19 07:43:23,012 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 121.6MB. Free memory is still 77.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:43:23,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 665.77ms. Allocated memory is still 159.4MB. Free memory was 126.9MB in the beginning and 103.9MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 07:43:23,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.83ms. Allocated memory is still 159.4MB. Free memory was 103.9MB in the beginning and 101.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:43:23,013 INFO L158 Benchmark]: Boogie Preprocessor took 40.71ms. Allocated memory is still 159.4MB. Free memory was 101.0MB in the beginning and 99.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:43:23,014 INFO L158 Benchmark]: RCFGBuilder took 819.57ms. Allocated memory is still 159.4MB. Free memory was 99.1MB in the beginning and 126.6MB in the end (delta: -27.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-11-19 07:43:23,015 INFO L158 Benchmark]: TraceAbstraction took 12414.64ms. Allocated memory was 159.4MB in the beginning and 260.0MB in the end (delta: 100.7MB). Free memory was 127.9MB in the beginning and 186.6MB in the end (delta: -58.7MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2023-11-19 07:43:23,015 INFO L158 Benchmark]: Witness Printer took 123.02ms. Allocated memory is still 260.0MB. Free memory was 186.6MB in the beginning and 178.2MB in the end (delta: 8.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-19 07:43:23,018 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.34ms. Allocated memory is still 121.6MB. Free memory is still 77.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 665.77ms. Allocated memory is still 159.4MB. Free memory was 126.9MB in the beginning and 103.9MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.83ms. Allocated memory is still 159.4MB. Free memory was 103.9MB in the beginning and 101.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.71ms. Allocated memory is still 159.4MB. Free memory was 101.0MB in the beginning and 99.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 819.57ms. Allocated memory is still 159.4MB. Free memory was 99.1MB in the beginning and 126.6MB in the end (delta: -27.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12414.64ms. Allocated memory was 159.4MB in the beginning and 260.0MB in the end (delta: 100.7MB). Free memory was 127.9MB in the beginning and 186.6MB in the end (delta: -58.7MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. * Witness Printer took 123.02ms. Allocated memory is still 260.0MB. Free memory was 186.6MB in the beginning and 178.2MB in the end (delta: 8.4MB). 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~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 118 PlacesBefore, 31 PlacesAfterwards, 110 TransitionsBefore, 22 TransitionsAfterwards, 2304 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 102 TotalNumberOfCompositions, 4151 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2453, independent: 2314, independent conditional: 0, independent unconditional: 2314, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1259, independent: 1228, independent conditional: 0, independent unconditional: 1228, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2453, independent: 1086, independent conditional: 0, independent unconditional: 1086, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 1259, unknown conditional: 0, unknown unconditional: 1259] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L827] 0 pthread_t t2577; [L828] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577={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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t2578; [L830] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, t2578={6: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L831] 0 pthread_t t2579; [L832] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L743] 1 z = 2 [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L760] 2 x = 1 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L805] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L808] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L809] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L812] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 3 return 0; [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L836] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L836] RET 0 assume_abort_if_not(main$tmp_guard0) [L838] 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) [L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] 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 [L841] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L842] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L845] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) [L847] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=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: 830]: 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: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 142 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 459 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 399 mSDsluCounter, 172 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 874 IncrementalHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 51 mSDtfsCounter, 874 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=7, InterpolantAutomatonStates: 60, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 972 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-19 07:43:23,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e64f9d8-329c-4719-ba30-67597a1d4371/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE