./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea40683-50d7-4865-a8d3-4d96056b50a0/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea40683-50d7-4865-a8d3-4d96056b50a0/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_cea40683-50d7-4865-a8d3-4d96056b50a0/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea40683-50d7-4865-a8d3-4d96056b50a0/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea40683-50d7-4865-a8d3-4d96056b50a0/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_cea40683-50d7-4865-a8d3-4d96056b50a0/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 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:44:21,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:44:21,372 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea40683-50d7-4865-a8d3-4d96056b50a0/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:44:21,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:44:21,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:44:21,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:44:21,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:44:21,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:44:21,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:44:21,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:44:21,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:44:21,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:44:21,409 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:44:21,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:44:21,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:44:21,411 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:44:21,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:44:21,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:44:21,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:44:21,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:44:21,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:44:21,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:44:21,415 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:44:21,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:44:21,417 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:44:21,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:44:21,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:44:21,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:44:21,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:44:21,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:44:21,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:44:21,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:44:21,421 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:44:21,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:44:21,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:44:21,422 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:44:21,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:44:21,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:44:21,423 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:44:21,424 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_cea40683-50d7-4865-a8d3-4d96056b50a0/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_cea40683-50d7-4865-a8d3-4d96056b50a0/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 -> 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 [2023-11-19 07:44:21,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:44:21,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:44:21,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:44:21,773 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:44:21,775 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:44:21,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea40683-50d7-4865-a8d3-4d96056b50a0/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2023-11-19 07:44:24,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:44:25,068 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:44:25,069 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea40683-50d7-4865-a8d3-4d96056b50a0/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2023-11-19 07:44:25,094 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea40683-50d7-4865-a8d3-4d96056b50a0/bin/uautomizer-verify-uCwYo4JHxu/data/3d5362653/e2f2d27ad5b54c7b94791fe4b63432f2/FLAG965a9beed [2023-11-19 07:44:25,109 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea40683-50d7-4865-a8d3-4d96056b50a0/bin/uautomizer-verify-uCwYo4JHxu/data/3d5362653/e2f2d27ad5b54c7b94791fe4b63432f2 [2023-11-19 07:44:25,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:44:25,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:44:25,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:44:25,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:44:25,121 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:44:25,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:44:25" (1/1) ... [2023-11-19 07:44:25,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fa33936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:25, skipping insertion in model container [2023-11-19 07:44:25,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:44:25" (1/1) ... [2023-11-19 07:44:25,197 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:44:25,431 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_cea40683-50d7-4865-a8d3-4d96056b50a0/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i[951,964] [2023-11-19 07:44:25,616 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:44:25,631 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:44:25,651 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_cea40683-50d7-4865-a8d3-4d96056b50a0/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i[951,964] [2023-11-19 07:44:25,704 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:44:25,739 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:44:25,740 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:44:25,747 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:44:25,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:25 WrapperNode [2023-11-19 07:44:25,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:44:25,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:44:25,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:44:25,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:44:25,757 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:44:25" (1/1) ... [2023-11-19 07:44:25,774 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:44:25" (1/1) ... [2023-11-19 07:44:25,804 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2023-11-19 07:44:25,804 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:44:25,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:44:25,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:44:25,805 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:44:25,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:25" (1/1) ... [2023-11-19 07:44:25,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:25" (1/1) ... [2023-11-19 07:44:25,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:25" (1/1) ... [2023-11-19 07:44:25,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:25" (1/1) ... [2023-11-19 07:44:25,845 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:25" (1/1) ... [2023-11-19 07:44:25,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:25" (1/1) ... [2023-11-19 07:44:25,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:25" (1/1) ... [2023-11-19 07:44:25,869 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:25" (1/1) ... [2023-11-19 07:44:25,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:44:25,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:44:25,876 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:44:25,876 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:44:25,877 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:25" (1/1) ... [2023-11-19 07:44:25,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:44:25,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea40683-50d7-4865-a8d3-4d96056b50a0/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:25,926 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea40683-50d7-4865-a8d3-4d96056b50a0/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:44:25,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea40683-50d7-4865-a8d3-4d96056b50a0/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:44:25,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:44:25,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:44:25,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:44:25,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:44:25,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:44:25,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:44:25,979 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:44:25,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:44:25,980 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:44:25,980 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:44:25,981 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:44:25,982 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:44:25,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:44:25,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:44:25,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:44:25,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:44:25,984 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:44:26,201 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:44:26,203 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:44:26,749 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:44:27,217 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:44:27,218 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:44:27,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:44:27 BoogieIcfgContainer [2023-11-19 07:44:27,225 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:44:27,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:44:27,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:44:27,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:44:27,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:44:25" (1/3) ... [2023-11-19 07:44:27,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f512433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:44:27, skipping insertion in model container [2023-11-19 07:44:27,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:25" (2/3) ... [2023-11-19 07:44:27,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f512433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:44:27, skipping insertion in model container [2023-11-19 07:44:27,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:44:27" (3/3) ... [2023-11-19 07:44:27,237 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.opt.i [2023-11-19 07:44:27,246 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:44:27,257 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:44:27,257 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 07:44:27,257 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:44:27,358 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:44:27,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 131 transitions, 274 flow [2023-11-19 07:44:27,492 INFO L124 PetriNetUnfolderBase]: 3/128 cut-off events. [2023-11-19 07:44:27,493 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:44:27,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 128 events. 3/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2023-11-19 07:44:27,500 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 131 transitions, 274 flow [2023-11-19 07:44:27,510 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 128 transitions, 265 flow [2023-11-19 07:44:27,516 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:44:27,537 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 128 transitions, 265 flow [2023-11-19 07:44:27,540 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 128 transitions, 265 flow [2023-11-19 07:44:27,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 128 transitions, 265 flow [2023-11-19 07:44:27,589 INFO L124 PetriNetUnfolderBase]: 3/128 cut-off events. [2023-11-19 07:44:27,590 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:44:27,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 128 events. 3/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2023-11-19 07:44:27,597 INFO L119 LiptonReduction]: Number of co-enabled transitions 2218 [2023-11-19 07:44:38,092 INFO L134 LiptonReduction]: Checked pairs total: 5988 [2023-11-19 07:44:38,092 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-11-19 07:44:38,108 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:44:38,115 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;@38612a06, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:44:38,116 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-19 07:44:38,121 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:44:38,121 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-11-19 07:44:38,121 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:44:38,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:44:38,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-19 07:44:38,123 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:44:38,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:38,128 INFO L85 PathProgramCache]: Analyzing trace with hash 26176435, now seen corresponding path program 1 times [2023-11-19 07:44:38,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:38,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133674846] [2023-11-19 07:44:38,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:38,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:38,659 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:44:38,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:38,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133674846] [2023-11-19 07:44:38,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133674846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:44:38,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:44:38,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:44:38,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246278571] [2023-11-19 07:44:38,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:44:38,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:44:38,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:38,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:44:38,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:44:38,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 244 [2023-11-19 07:44:38,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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:44:38,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:44:38,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 244 [2023-11-19 07:44:38,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:44:39,346 INFO L124 PetriNetUnfolderBase]: 911/1372 cut-off events. [2023-11-19 07:44:39,346 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-19 07:44:39,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2791 conditions, 1372 events. 911/1372 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6526 event pairs, 311 based on Foata normal form. 0/1284 useless extension candidates. Maximal degree in co-relation 2780. Up to 871 conditions per place. [2023-11-19 07:44:39,360 INFO L140 encePairwiseOnDemand]: 241/244 looper letters, 30 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-11-19 07:44:39,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 155 flow [2023-11-19 07:44:39,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:44:39,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:44:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2023-11-19 07:44:39,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5191256830601093 [2023-11-19 07:44:39,378 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2023-11-19 07:44:39,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2023-11-19 07:44:39,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:44:39,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2023-11-19 07:44:39,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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:44:39,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 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:44:39,395 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 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:44:39,397 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 380 transitions. [2023-11-19 07:44:39,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 155 flow [2023-11-19 07:44:39,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 150 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 07:44:39,403 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-11-19 07:44:39,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-11-19 07:44:39,409 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-11-19 07:44:39,409 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-11-19 07:44:39,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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:44:39,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:44:39,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:44:39,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:44:39,411 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:44:39,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:39,412 INFO L85 PathProgramCache]: Analyzing trace with hash -992333750, now seen corresponding path program 1 times [2023-11-19 07:44:39,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:39,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222806299] [2023-11-19 07:44:39,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:39,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:39,748 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:44:39,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:39,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222806299] [2023-11-19 07:44:39,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222806299] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:44:39,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:44:39,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:44:39,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954075161] [2023-11-19 07:44:39,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:44:39,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:44:39,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:39,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:44:39,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:44:39,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 244 [2023-11-19 07:44:39,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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:44:39,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:44:39,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 244 [2023-11-19 07:44:39,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:44:40,248 INFO L124 PetriNetUnfolderBase]: 1108/1649 cut-off events. [2023-11-19 07:44:40,248 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2023-11-19 07:44:40,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3472 conditions, 1649 events. 1108/1649 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6568 event pairs, 328 based on Foata normal form. 20/1669 useless extension candidates. Maximal degree in co-relation 3462. Up to 1436 conditions per place. [2023-11-19 07:44:40,275 INFO L140 encePairwiseOnDemand]: 240/244 looper letters, 30 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2023-11-19 07:44:40,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 146 flow [2023-11-19 07:44:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:44:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:44:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2023-11-19 07:44:40,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095628415300546 [2023-11-19 07:44:40,280 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2023-11-19 07:44:40,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2023-11-19 07:44:40,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:44:40,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2023-11-19 07:44:40,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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:44:40,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 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:44:40,286 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 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:44:40,286 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 373 transitions. [2023-11-19 07:44:40,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 146 flow [2023-11-19 07:44:40,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:44:40,289 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 67 flow [2023-11-19 07:44:40,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-11-19 07:44:40,290 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-11-19 07:44:40,290 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 67 flow [2023-11-19 07:44:40,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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:44:40,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:44:40,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:44:40,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:44:40,291 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:44:40,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:40,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1314293407, now seen corresponding path program 1 times [2023-11-19 07:44:40,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:40,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779442943] [2023-11-19 07:44:40,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:40,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:40,540 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:44:40,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:40,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779442943] [2023-11-19 07:44:40,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779442943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:44:40,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:44:40,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:44:40,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172051149] [2023-11-19 07:44:40,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:44:40,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:44:40,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:40,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:44:40,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:44:40,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 244 [2023-11-19 07:44:40,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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:44:40,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:44:40,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 244 [2023-11-19 07:44:40,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:44:41,150 INFO L124 PetriNetUnfolderBase]: 1328/2019 cut-off events. [2023-11-19 07:44:41,150 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2023-11-19 07:44:41,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4425 conditions, 2019 events. 1328/2019 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9051 event pairs, 623 based on Foata normal form. 75/2094 useless extension candidates. Maximal degree in co-relation 4414. Up to 1135 conditions per place. [2023-11-19 07:44:41,165 INFO L140 encePairwiseOnDemand]: 241/244 looper letters, 33 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2023-11-19 07:44:41,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 167 flow [2023-11-19 07:44:41,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:44:41,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:44:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-11-19 07:44:41,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5122950819672131 [2023-11-19 07:44:41,168 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-11-19 07:44:41,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-11-19 07:44:41,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:44:41,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-11-19 07:44:41,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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:44:41,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 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:44:41,174 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 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:44:41,174 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 67 flow. Second operand 3 states and 375 transitions. [2023-11-19 07:44:41,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 167 flow [2023-11-19 07:44:41,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:44:41,177 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 75 flow [2023-11-19 07:44:41,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-11-19 07:44:41,179 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2023-11-19 07:44:41,182 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 75 flow [2023-11-19 07:44:41,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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:44:41,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:44:41,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:44:41,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:44:41,185 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:44:41,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:41,186 INFO L85 PathProgramCache]: Analyzing trace with hash -194841060, now seen corresponding path program 1 times [2023-11-19 07:44:41,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:41,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080505446] [2023-11-19 07:44:41,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:41,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:41,409 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:44:41,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:41,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080505446] [2023-11-19 07:44:41,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080505446] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:44:41,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:44:41,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:44:41,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064827758] [2023-11-19 07:44:41,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:44:41,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:44:41,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:41,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:44:41,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:44:41,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 244 [2023-11-19 07:44:41,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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:44:41,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:44:41,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 244 [2023-11-19 07:44:41,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:44:41,893 INFO L124 PetriNetUnfolderBase]: 934/1448 cut-off events. [2023-11-19 07:44:41,894 INFO L125 PetriNetUnfolderBase]: For 236/289 co-relation queries the response was YES. [2023-11-19 07:44:41,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3093 conditions, 1448 events. 934/1448 cut-off events. For 236/289 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7355 event pairs, 154 based on Foata normal form. 19/1431 useless extension candidates. Maximal degree in co-relation 3081. Up to 1256 conditions per place. [2023-11-19 07:44:41,904 INFO L140 encePairwiseOnDemand]: 241/244 looper letters, 29 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-11-19 07:44:41,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 35 transitions, 165 flow [2023-11-19 07:44:41,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:44:41,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:44:41,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-11-19 07:44:41,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5109289617486339 [2023-11-19 07:44:41,908 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-11-19 07:44:41,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-11-19 07:44:41,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:44:41,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-11-19 07:44:41,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:44:41,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 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:44:41,913 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 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:44:41,913 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 75 flow. Second operand 3 states and 374 transitions. [2023-11-19 07:44:41,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 35 transitions, 165 flow [2023-11-19 07:44:41,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 160 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-19 07:44:41,918 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 78 flow [2023-11-19 07:44:41,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-11-19 07:44:41,920 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2023-11-19 07:44:41,921 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 78 flow [2023-11-19 07:44:41,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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:44:41,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:44:41,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:44:41,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:44:41,922 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:44:41,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:41,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1829117149, now seen corresponding path program 1 times [2023-11-19 07:44:41,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:41,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510702978] [2023-11-19 07:44:41,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:41,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:42,217 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:44:42,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:42,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510702978] [2023-11-19 07:44:42,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510702978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:44:42,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:44:42,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:44:42,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196559778] [2023-11-19 07:44:42,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:44:42,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:44:42,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:42,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:44:42,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:44:42,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 244 [2023-11-19 07:44:42,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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:44:42,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:44:42,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 244 [2023-11-19 07:44:42,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:44:42,672 INFO L124 PetriNetUnfolderBase]: 905/1505 cut-off events. [2023-11-19 07:44:42,672 INFO L125 PetriNetUnfolderBase]: For 502/502 co-relation queries the response was YES. [2023-11-19 07:44:42,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3475 conditions, 1505 events. 905/1505 cut-off events. For 502/502 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7597 event pairs, 198 based on Foata normal form. 12/1493 useless extension candidates. Maximal degree in co-relation 3461. Up to 1218 conditions per place. [2023-11-19 07:44:42,683 INFO L140 encePairwiseOnDemand]: 241/244 looper letters, 28 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2023-11-19 07:44:42,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 34 transitions, 165 flow [2023-11-19 07:44:42,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:44:42,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:44:42,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-11-19 07:44:42,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51775956284153 [2023-11-19 07:44:42,686 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-11-19 07:44:42,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-11-19 07:44:42,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:44:42,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-11-19 07:44:42,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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:44:42,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 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:44:42,692 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 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:44:42,692 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 78 flow. Second operand 3 states and 379 transitions. [2023-11-19 07:44:42,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 34 transitions, 165 flow [2023-11-19 07:44:42,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 34 transitions, 159 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:44:42,696 INFO L231 Difference]: Finished difference. Result has 36 places, 23 transitions, 82 flow [2023-11-19 07:44:42,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2023-11-19 07:44:42,700 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2023-11-19 07:44:42,700 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 82 flow [2023-11-19 07:44:42,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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:44:42,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:44:42,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:44:42,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:44:42,702 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:44:42,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:42,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1130355558, now seen corresponding path program 1 times [2023-11-19 07:44:42,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:42,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137008670] [2023-11-19 07:44:42,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:42,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:43,039 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:44:43,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:43,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137008670] [2023-11-19 07:44:43,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137008670] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:44:43,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:44:43,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:44:43,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173424731] [2023-11-19 07:44:43,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:44:43,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:44:43,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:43,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:44:43,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:44:43,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 244 [2023-11-19 07:44:43,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:44:43,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:44:43,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 244 [2023-11-19 07:44:43,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:44:43,911 INFO L124 PetriNetUnfolderBase]: 1962/3001 cut-off events. [2023-11-19 07:44:43,912 INFO L125 PetriNetUnfolderBase]: For 1374/1374 co-relation queries the response was YES. [2023-11-19 07:44:43,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7022 conditions, 3001 events. 1962/3001 cut-off events. For 1374/1374 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 14819 event pairs, 366 based on Foata normal form. 48/3049 useless extension candidates. Maximal degree in co-relation 7007. Up to 1420 conditions per place. [2023-11-19 07:44:43,928 INFO L140 encePairwiseOnDemand]: 239/244 looper letters, 36 selfloop transitions, 4 changer transitions 8/48 dead transitions. [2023-11-19 07:44:43,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 48 transitions, 245 flow [2023-11-19 07:44:43,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:44:43,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:44:43,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2023-11-19 07:44:43,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051229508196722 [2023-11-19 07:44:43,932 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 493 transitions. [2023-11-19 07:44:43,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 493 transitions. [2023-11-19 07:44:43,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:44:43,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 493 transitions. [2023-11-19 07:44:43,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 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:44:43,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 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:44:43,938 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 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:44:43,939 INFO L175 Difference]: Start difference. First operand has 36 places, 23 transitions, 82 flow. Second operand 4 states and 493 transitions. [2023-11-19 07:44:43,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 48 transitions, 245 flow [2023-11-19 07:44:43,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 237 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:44:43,943 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 91 flow [2023-11-19 07:44:43,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2023-11-19 07:44:43,946 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2023-11-19 07:44:43,946 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 91 flow [2023-11-19 07:44:43,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:44:43,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:44:43,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:44:43,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:44:43,947 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:44:43,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:43,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1069090368, now seen corresponding path program 2 times [2023-11-19 07:44:43,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:43,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564255514] [2023-11-19 07:44:43,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:43,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:44,230 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:44:44,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:44,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564255514] [2023-11-19 07:44:44,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564255514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:44:44,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:44:44,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:44:44,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771463125] [2023-11-19 07:44:44,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:44:44,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:44:44,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:44,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:44:44,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:44:44,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 244 [2023-11-19 07:44:44,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:44:44,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:44:44,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 244 [2023-11-19 07:44:44,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:44:44,785 INFO L124 PetriNetUnfolderBase]: 1353/2068 cut-off events. [2023-11-19 07:44:44,786 INFO L125 PetriNetUnfolderBase]: For 1537/1537 co-relation queries the response was YES. [2023-11-19 07:44:44,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5029 conditions, 2068 events. 1353/2068 cut-off events. For 1537/1537 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9481 event pairs, 543 based on Foata normal form. 48/2116 useless extension candidates. Maximal degree in co-relation 5013. Up to 1363 conditions per place. [2023-11-19 07:44:44,798 INFO L140 encePairwiseOnDemand]: 239/244 looper letters, 30 selfloop transitions, 3 changer transitions 7/40 dead transitions. [2023-11-19 07:44:44,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 214 flow [2023-11-19 07:44:44,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:44:44,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:44:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2023-11-19 07:44:44,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4969262295081967 [2023-11-19 07:44:44,804 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 485 transitions. [2023-11-19 07:44:44,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 485 transitions. [2023-11-19 07:44:44,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:44:44,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 485 transitions. [2023-11-19 07:44:44,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 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:44:44,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 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:44:44,810 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 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:44:44,812 INFO L175 Difference]: Start difference. First operand has 38 places, 23 transitions, 91 flow. Second operand 4 states and 485 transitions. [2023-11-19 07:44:44,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 214 flow [2023-11-19 07:44:44,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 199 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-11-19 07:44:44,819 INFO L231 Difference]: Finished difference. Result has 38 places, 21 transitions, 78 flow [2023-11-19 07:44:44,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=38, PETRI_TRANSITIONS=21} [2023-11-19 07:44:44,820 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2023-11-19 07:44:44,820 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 21 transitions, 78 flow [2023-11-19 07:44:44,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:44:44,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:44:44,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:44:44,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:44:44,821 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:44:44,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:44,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1192059914, now seen corresponding path program 1 times [2023-11-19 07:44:44,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:44,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425499194] [2023-11-19 07:44:44,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:44,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:45,108 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:44:45,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:45,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425499194] [2023-11-19 07:44:45,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425499194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:44:45,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:44:45,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:44:45,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870825240] [2023-11-19 07:44:45,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:44:45,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:44:45,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:45,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:44:45,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:44:45,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 244 [2023-11-19 07:44:45,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 21 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 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:44:45,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:44:45,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 244 [2023-11-19 07:44:45,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:44:45,562 INFO L124 PetriNetUnfolderBase]: 752/1164 cut-off events. [2023-11-19 07:44:45,563 INFO L125 PetriNetUnfolderBase]: For 1125/1125 co-relation queries the response was YES. [2023-11-19 07:44:45,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2766 conditions, 1164 events. 752/1164 cut-off events. For 1125/1125 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4681 event pairs, 223 based on Foata normal form. 36/1200 useless extension candidates. Maximal degree in co-relation 2751. Up to 516 conditions per place. [2023-11-19 07:44:45,575 INFO L140 encePairwiseOnDemand]: 240/244 looper letters, 25 selfloop transitions, 2 changer transitions 21/48 dead transitions. [2023-11-19 07:44:45,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 238 flow [2023-11-19 07:44:45,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:44:45,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:44:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2023-11-19 07:44:45,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49508196721311476 [2023-11-19 07:44:45,580 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 604 transitions. [2023-11-19 07:44:45,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 604 transitions. [2023-11-19 07:44:45,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:44:45,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 604 transitions. [2023-11-19 07:44:45,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 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:44:45,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 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:44:45,588 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 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:44:45,589 INFO L175 Difference]: Start difference. First operand has 38 places, 21 transitions, 78 flow. Second operand 5 states and 604 transitions. [2023-11-19 07:44:45,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 238 flow [2023-11-19 07:44:45,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 215 flow, removed 3 selfloop flow, removed 7 redundant places. [2023-11-19 07:44:45,594 INFO L231 Difference]: Finished difference. Result has 37 places, 21 transitions, 68 flow [2023-11-19 07:44:45,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=21} [2023-11-19 07:44:45,597 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2023-11-19 07:44:45,597 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 21 transitions, 68 flow [2023-11-19 07:44:45,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 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:44:45,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:44:45,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:44:45,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:44:45,599 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:44:45,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:45,599 INFO L85 PathProgramCache]: Analyzing trace with hash -47119060, now seen corresponding path program 2 times [2023-11-19 07:44:45,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:45,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336738582] [2023-11-19 07:44:45,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:45,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:45,953 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:44:45,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:45,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336738582] [2023-11-19 07:44:45,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336738582] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:44:45,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:44:45,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:44:45,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894418520] [2023-11-19 07:44:45,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:44:45,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:44:45,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:45,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:44:45,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:44:45,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 244 [2023-11-19 07:44:45,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 21 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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:44:45,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:44:45,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 244 [2023-11-19 07:44:45,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:44:46,193 INFO L124 PetriNetUnfolderBase]: 269/466 cut-off events. [2023-11-19 07:44:46,193 INFO L125 PetriNetUnfolderBase]: For 137/139 co-relation queries the response was YES. [2023-11-19 07:44:46,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 466 events. 269/466 cut-off events. For 137/139 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1853 event pairs, 49 based on Foata normal form. 50/515 useless extension candidates. Maximal degree in co-relation 1074. Up to 296 conditions per place. [2023-11-19 07:44:46,196 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 26 selfloop transitions, 4 changer transitions 20/52 dead transitions. [2023-11-19 07:44:46,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 52 transitions, 244 flow [2023-11-19 07:44:46,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:44:46,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:44:46,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2023-11-19 07:44:46,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4934426229508197 [2023-11-19 07:44:46,200 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 602 transitions. [2023-11-19 07:44:46,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 602 transitions. [2023-11-19 07:44:46,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:44:46,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 602 transitions. [2023-11-19 07:44:46,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 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:44:46,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 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:44:46,207 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 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:44:46,207 INFO L175 Difference]: Start difference. First operand has 37 places, 21 transitions, 68 flow. Second operand 5 states and 602 transitions. [2023-11-19 07:44:46,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 52 transitions, 244 flow [2023-11-19 07:44:46,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 52 transitions, 234 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-19 07:44:46,210 INFO L231 Difference]: Finished difference. Result has 38 places, 24 transitions, 94 flow [2023-11-19 07:44:46,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2023-11-19 07:44:46,210 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2023-11-19 07:44:46,211 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 94 flow [2023-11-19 07:44:46,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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:44:46,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:44:46,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:44:46,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:44:46,212 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:44:46,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:46,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1137924089, now seen corresponding path program 1 times [2023-11-19 07:44:46,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:46,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220383829] [2023-11-19 07:44:46,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:46,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:46,518 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:44:46,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:46,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220383829] [2023-11-19 07:44:46,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220383829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:44:46,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:44:46,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:44:46,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923267066] [2023-11-19 07:44:46,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:44:46,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:44:46,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:46,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:44:46,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:44:46,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 244 [2023-11-19 07:44:46,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:44:46,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:44:46,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 244 [2023-11-19 07:44:46,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:44:46,740 INFO L124 PetriNetUnfolderBase]: 123/243 cut-off events. [2023-11-19 07:44:46,741 INFO L125 PetriNetUnfolderBase]: For 119/120 co-relation queries the response was YES. [2023-11-19 07:44:46,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 243 events. 123/243 cut-off events. For 119/120 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 826 event pairs, 21 based on Foata normal form. 30/272 useless extension candidates. Maximal degree in co-relation 722. Up to 101 conditions per place. [2023-11-19 07:44:46,743 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 31 selfloop transitions, 7 changer transitions 18/58 dead transitions. [2023-11-19 07:44:46,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 58 transitions, 328 flow [2023-11-19 07:44:46,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:44:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:44:46,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 718 transitions. [2023-11-19 07:44:46,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49043715846994534 [2023-11-19 07:44:46,748 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 718 transitions. [2023-11-19 07:44:46,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 718 transitions. [2023-11-19 07:44:46,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:44:46,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 718 transitions. [2023-11-19 07:44:46,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.66666666666667) internal successors, (718), 6 states have internal predecessors, (718), 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:44:46,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 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:44:46,755 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 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:44:46,756 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 94 flow. Second operand 6 states and 718 transitions. [2023-11-19 07:44:46,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 58 transitions, 328 flow [2023-11-19 07:44:46,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 58 transitions, 322 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-19 07:44:46,758 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 144 flow [2023-11-19 07:44:46,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2023-11-19 07:44:46,759 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2023-11-19 07:44:46,759 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 144 flow [2023-11-19 07:44:46,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:44:46,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:44:46,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:44:46,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:44:46,761 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:44:46,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:46,761 INFO L85 PathProgramCache]: Analyzing trace with hash 319846037, now seen corresponding path program 1 times [2023-11-19 07:44:46,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:46,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501113890] [2023-11-19 07:44:46,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:46,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:47,079 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:44:47,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:47,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501113890] [2023-11-19 07:44:47,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501113890] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:44:47,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:44:47,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:44:47,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91368744] [2023-11-19 07:44:47,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:44:47,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:44:47,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:47,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:44:47,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:44:47,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 244 [2023-11-19 07:44:47,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 144 flow. Second operand has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:44:47,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:44:47,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 244 [2023-11-19 07:44:47,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:44:47,282 INFO L124 PetriNetUnfolderBase]: 67/143 cut-off events. [2023-11-19 07:44:47,282 INFO L125 PetriNetUnfolderBase]: For 176/177 co-relation queries the response was YES. [2023-11-19 07:44:47,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 143 events. 67/143 cut-off events. For 176/177 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 385 event pairs, 18 based on Foata normal form. 9/151 useless extension candidates. Maximal degree in co-relation 470. Up to 55 conditions per place. [2023-11-19 07:44:47,284 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 28 selfloop transitions, 10 changer transitions 9/49 dead transitions. [2023-11-19 07:44:47,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 322 flow [2023-11-19 07:44:47,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:44:47,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:44:47,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 819 transitions. [2023-11-19 07:44:47,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47950819672131145 [2023-11-19 07:44:47,289 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 819 transitions. [2023-11-19 07:44:47,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 819 transitions. [2023-11-19 07:44:47,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:44:47,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 819 transitions. [2023-11-19 07:44:47,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 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:44:47,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 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:44:47,297 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 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:44:47,297 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 144 flow. Second operand 7 states and 819 transitions. [2023-11-19 07:44:47,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 322 flow [2023-11-19 07:44:47,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 279 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-11-19 07:44:47,300 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 142 flow [2023-11-19 07:44:47,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=142, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2023-11-19 07:44:47,301 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2023-11-19 07:44:47,302 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 142 flow [2023-11-19 07:44:47,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:44:47,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:44:47,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:44:47,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:44:47,303 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:44:47,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:47,303 INFO L85 PathProgramCache]: Analyzing trace with hash -922702244, now seen corresponding path program 1 times [2023-11-19 07:44:47,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:47,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886518978] [2023-11-19 07:44:47,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:47,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:47,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:44:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:47,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:44:47,653 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:44:47,654 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-19 07:44:47,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-19 07:44:47,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-19 07:44:47,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-19 07:44:47,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-19 07:44:47,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-19 07:44:47,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:44:47,658 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:44:47,664 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:44:47,665 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:44:47,764 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre28 could not be translated [2023-11-19 07:44:47,767 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated [2023-11-19 07:44:47,771 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated [2023-11-19 07:44:47,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:44:47 BasicIcfg [2023-11-19 07:44:47,799 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:44:47,800 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:44:47,800 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:44:47,800 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:44:47,800 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:44:27" (3/4) ... [2023-11-19 07:44:47,801 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 07:44:47,835 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre28 could not be translated [2023-11-19 07:44:47,836 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated [2023-11-19 07:44:47,840 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated [2023-11-19 07:44:47,942 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea40683-50d7-4865-a8d3-4d96056b50a0/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:44:47,942 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:44:47,943 INFO L158 Benchmark]: Toolchain (without parser) took 22829.41ms. Allocated memory was 153.1MB in the beginning and 371.2MB in the end (delta: 218.1MB). Free memory was 112.9MB in the beginning and 224.3MB in the end (delta: -111.3MB). Peak memory consumption was 106.0MB. Max. memory is 16.1GB. [2023-11-19 07:44:47,943 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 119.5MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:44:47,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 633.52ms. Allocated memory is still 153.1MB. Free memory was 112.9MB in the beginning and 105.5MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-19 07:44:47,944 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.44ms. Allocated memory is still 153.1MB. Free memory was 105.5MB in the beginning and 103.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:44:47,944 INFO L158 Benchmark]: Boogie Preprocessor took 69.73ms. Allocated memory is still 153.1MB. Free memory was 103.0MB in the beginning and 100.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:44:47,945 INFO L158 Benchmark]: RCFGBuilder took 1349.49ms. Allocated memory is still 153.1MB. Free memory was 100.6MB in the beginning and 100.2MB in the end (delta: 343.0kB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2023-11-19 07:44:47,945 INFO L158 Benchmark]: TraceAbstraction took 20569.52ms. Allocated memory was 153.1MB in the beginning and 371.2MB in the end (delta: 218.1MB). Free memory was 99.6MB in the beginning and 240.0MB in the end (delta: -140.4MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. [2023-11-19 07:44:47,946 INFO L158 Benchmark]: Witness Printer took 142.63ms. Allocated memory is still 371.2MB. Free memory was 240.0MB in the beginning and 224.3MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 07:44:47,948 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.53ms. Allocated memory is still 119.5MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 633.52ms. Allocated memory is still 153.1MB. Free memory was 112.9MB in the beginning and 105.5MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.44ms. Allocated memory is still 153.1MB. Free memory was 105.5MB in the beginning and 103.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.73ms. Allocated memory is still 153.1MB. Free memory was 103.0MB in the beginning and 100.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1349.49ms. Allocated memory is still 153.1MB. Free memory was 100.6MB in the beginning and 100.2MB in the end (delta: 343.0kB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. * TraceAbstraction took 20569.52ms. Allocated memory was 153.1MB in the beginning and 371.2MB in the end (delta: 218.1MB). Free memory was 99.6MB in the beginning and 240.0MB in the end (delta: -140.4MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. * Witness Printer took 142.63ms. Allocated memory is still 371.2MB. Free memory was 240.0MB in the beginning and 224.3MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre28 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre28 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre32 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: 10.6s, 135 PlacesBefore, 33 PlacesAfterwards, 128 TransitionsBefore, 23 TransitionsAfterwards, 2218 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 3 ChoiceCompositions, 113 TotalNumberOfCompositions, 5988 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2517, independent: 2299, independent conditional: 0, independent unconditional: 2299, dependent: 218, dependent conditional: 0, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1189, independent: 1133, independent conditional: 0, independent unconditional: 1133, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2517, independent: 1166, independent conditional: 0, independent unconditional: 1166, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 1189, unknown conditional: 0, unknown unconditional: 1189] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 75, Positive conditional cache size: 0, Positive unconditional cache size: 75, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, 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 __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L731] 0 int __unbuffered_p2_EAX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1780; [L854] FCALL, FORK 0 pthread_create(&t1780, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1780={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t1781; [L856] FCALL, FORK 0 pthread_create(&t1781, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1780={7:0}, t1781={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L857] 0 pthread_t t1782; [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 \read(x) [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L858] FCALL, FORK 0 pthread_create(&t1782, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1780={7:0}, t1781={8:0}, t1782={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L828] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L760] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780={7:0}, t1781={8:0}, t1782={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L875] 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=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 854]: 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: 856]: 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, 157 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: 20.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 297 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 725 IncrementalHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 19 mSDtfsCounter, 725 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=10, InterpolantAutomatonStates: 46, 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.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 372 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:44:47,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea40683-50d7-4865-a8d3-4d96056b50a0/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE