./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix018.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_7824235d-92b1-43b7-a1e6-864e2477beaa/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7824235d-92b1-43b7-a1e6-864e2477beaa/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_7824235d-92b1-43b7-a1e6-864e2477beaa/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7824235d-92b1-43b7-a1e6-864e2477beaa/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix018.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7824235d-92b1-43b7-a1e6-864e2477beaa/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_7824235d-92b1-43b7-a1e6-864e2477beaa/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 a7349305eeae716fa3a7c11218caa894d6e5121d77db0055a98af7bd7c666586 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:39:00,597 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:39:00,717 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7824235d-92b1-43b7-a1e6-864e2477beaa/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:39:00,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:39:00,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:39:00,764 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:39:00,765 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:39:00,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:39:00,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:39:00,773 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:39:00,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:39:00,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:39:00,776 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:39:00,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:39:00,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:39:00,779 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:39:00,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:39:00,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:39:00,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:39:00,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:39:00,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:39:00,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:39:00,783 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:39:00,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:39:00,784 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:39:00,785 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:39:00,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:39:00,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:39:00,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:39:00,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:39:00,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:39:00,789 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:39:00,789 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:39:00,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:39:00,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:39:00,790 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:39:00,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:39:00,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:39:00,791 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:39:00,792 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_7824235d-92b1-43b7-a1e6-864e2477beaa/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_7824235d-92b1-43b7-a1e6-864e2477beaa/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 -> a7349305eeae716fa3a7c11218caa894d6e5121d77db0055a98af7bd7c666586 [2023-11-19 07:39:01,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:39:01,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:39:01,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:39:01,116 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:39:01,117 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:39:01,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7824235d-92b1-43b7-a1e6-864e2477beaa/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix018.opt.i [2023-11-19 07:39:04,460 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:39:04,770 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:39:04,770 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7824235d-92b1-43b7-a1e6-864e2477beaa/sv-benchmarks/c/pthread-wmm/mix018.opt.i [2023-11-19 07:39:04,805 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7824235d-92b1-43b7-a1e6-864e2477beaa/bin/uautomizer-verify-uCwYo4JHxu/data/5f1778efa/9f578dbab5844f2e8de69ae05889ae54/FLAG8fe664baa [2023-11-19 07:39:04,820 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7824235d-92b1-43b7-a1e6-864e2477beaa/bin/uautomizer-verify-uCwYo4JHxu/data/5f1778efa/9f578dbab5844f2e8de69ae05889ae54 [2023-11-19 07:39:04,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:39:04,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:39:04,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:39:04,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:39:04,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:39:04,838 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:39:04" (1/1) ... [2023-11-19 07:39:04,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29628353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:04, skipping insertion in model container [2023-11-19 07:39:04,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:39:04" (1/1) ... [2023-11-19 07:39:04,893 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:39:05,056 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_7824235d-92b1-43b7-a1e6-864e2477beaa/sv-benchmarks/c/pthread-wmm/mix018.opt.i[944,957] [2023-11-19 07:39:05,383 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:39:05,400 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:39:05,415 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_7824235d-92b1-43b7-a1e6-864e2477beaa/sv-benchmarks/c/pthread-wmm/mix018.opt.i[944,957] [2023-11-19 07:39:05,507 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:39:05,563 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:39:05,563 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:39:05,572 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:39:05,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05 WrapperNode [2023-11-19 07:39:05,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:39:05,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:39:05,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:39:05,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:39:05,585 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:39:05" (1/1) ... [2023-11-19 07:39:05,628 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:39:05" (1/1) ... [2023-11-19 07:39:05,713 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2023-11-19 07:39:05,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:39:05,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:39:05,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:39:05,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:39:05,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05" (1/1) ... [2023-11-19 07:39:05,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05" (1/1) ... [2023-11-19 07:39:05,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05" (1/1) ... [2023-11-19 07:39:05,734 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05" (1/1) ... [2023-11-19 07:39:05,746 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05" (1/1) ... [2023-11-19 07:39:05,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05" (1/1) ... [2023-11-19 07:39:05,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05" (1/1) ... [2023-11-19 07:39:05,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05" (1/1) ... [2023-11-19 07:39:05,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:39:05,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:39:05,761 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:39:05,762 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:39:05,762 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05" (1/1) ... [2023-11-19 07:39:05,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:39:05,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7824235d-92b1-43b7-a1e6-864e2477beaa/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:39:05,827 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7824235d-92b1-43b7-a1e6-864e2477beaa/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:39:05,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7824235d-92b1-43b7-a1e6-864e2477beaa/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:39:05,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:39:05,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:39:05,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:39:05,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:39:05,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:39:05,885 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:39:05,885 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:39:05,885 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:39:05,886 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:39:05,886 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:39:05,888 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:39:05,889 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-19 07:39:05,889 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-19 07:39:05,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:39:05,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:39:05,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:39:05,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:39:05,892 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:39:06,075 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:39:06,077 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:39:06,466 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:39:06,673 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:39:06,674 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:39:06,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:06 BoogieIcfgContainer [2023-11-19 07:39:06,684 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:39:06,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:39:06,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:39:06,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:39:06,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:39:04" (1/3) ... [2023-11-19 07:39:06,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a27dc4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:39:06, skipping insertion in model container [2023-11-19 07:39:06,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05" (2/3) ... [2023-11-19 07:39:06,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a27dc4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:39:06, skipping insertion in model container [2023-11-19 07:39:06,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:06" (3/3) ... [2023-11-19 07:39:06,696 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018.opt.i [2023-11-19 07:39:06,706 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:39:06,716 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:39:06,716 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 07:39:06,716 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:39:06,814 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:39:06,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 284 flow [2023-11-19 07:39:06,933 INFO L124 PetriNetUnfolderBase]: 2/130 cut-off events. [2023-11-19 07:39:06,933 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:39:06,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-11-19 07:39:06,941 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 134 transitions, 284 flow [2023-11-19 07:39:06,947 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 130 transitions, 272 flow [2023-11-19 07:39:06,951 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:39:06,962 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 130 transitions, 272 flow [2023-11-19 07:39:06,965 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 130 transitions, 272 flow [2023-11-19 07:39:06,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 272 flow [2023-11-19 07:39:07,004 INFO L124 PetriNetUnfolderBase]: 2/130 cut-off events. [2023-11-19 07:39:07,004 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:39:07,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-11-19 07:39:07,009 INFO L119 LiptonReduction]: Number of co-enabled transitions 3360 [2023-11-19 07:39:12,245 INFO L134 LiptonReduction]: Checked pairs total: 7364 [2023-11-19 07:39:12,245 INFO L136 LiptonReduction]: Total number of compositions: 114 [2023-11-19 07:39:12,277 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:39:12,288 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;@2034d417, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:39:12,288 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-19 07:39:12,305 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:39:12,305 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-11-19 07:39:12,305 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:39:12,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:12,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:12,307 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:39:12,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:12,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2143076149, now seen corresponding path program 1 times [2023-11-19 07:39:12,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:12,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763344677] [2023-11-19 07:39:12,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:12,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:13,036 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:39:13,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:13,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763344677] [2023-11-19 07:39:13,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763344677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:13,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:13,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:39:13,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351880450] [2023-11-19 07:39:13,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:13,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:39:13,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:13,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:39:13,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:39:13,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 248 [2023-11-19 07:39:13,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states 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:39:13,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:13,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 248 [2023-11-19 07:39:13,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:14,371 INFO L124 PetriNetUnfolderBase]: 4903/6992 cut-off events. [2023-11-19 07:39:14,372 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2023-11-19 07:39:14,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13840 conditions, 6992 events. 4903/6992 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 33917 event pairs, 999 based on Foata normal form. 0/6672 useless extension candidates. Maximal degree in co-relation 13828. Up to 5185 conditions per place. [2023-11-19 07:39:14,432 INFO L140 encePairwiseOnDemand]: 244/248 looper letters, 34 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2023-11-19 07:39:14,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 166 flow [2023-11-19 07:39:14,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:39:14,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:39:14,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-11-19 07:39:14,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5389784946236559 [2023-11-19 07:39:14,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-11-19 07:39:14,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-11-19 07:39:14,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:14,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-11-19 07:39:14,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states 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:39:14,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states 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:39:14,466 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states 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:39:14,468 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 401 transitions. [2023-11-19 07:39:14,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 166 flow [2023-11-19 07:39:14,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 39 transitions, 162 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:39:14,477 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 62 flow [2023-11-19 07:39:14,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-11-19 07:39:14,483 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-11-19 07:39:14,483 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 62 flow [2023-11-19 07:39:14,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states 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:39:14,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:14,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:14,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:39:14,485 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:39:14,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:14,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2088042406, now seen corresponding path program 1 times [2023-11-19 07:39:14,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:14,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594537099] [2023-11-19 07:39:14,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:14,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:14,759 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:39:14,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:14,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594537099] [2023-11-19 07:39:14,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594537099] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:14,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:14,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:39:14,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714300705] [2023-11-19 07:39:14,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:14,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:39:14,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:14,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:39:14,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:39:14,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 248 [2023-11-19 07:39:14,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states 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:39:14,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:14,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 248 [2023-11-19 07:39:14,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:15,588 INFO L124 PetriNetUnfolderBase]: 3511/5024 cut-off events. [2023-11-19 07:39:15,588 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2023-11-19 07:39:15,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10222 conditions, 5024 events. 3511/5024 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 22924 event pairs, 1399 based on Foata normal form. 128/5152 useless extension candidates. Maximal degree in co-relation 10212. Up to 3009 conditions per place. [2023-11-19 07:39:15,628 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 33 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2023-11-19 07:39:15,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 36 transitions, 154 flow [2023-11-19 07:39:15,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:39:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:39:15,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-11-19 07:39:15,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2023-11-19 07:39:15,633 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-11-19 07:39:15,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-11-19 07:39:15,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:15,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-11-19 07:39:15,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:15,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states 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:39:15,644 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states 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:39:15,644 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 3 states and 396 transitions. [2023-11-19 07:39:15,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 36 transitions, 154 flow [2023-11-19 07:39:15,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:39:15,651 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 66 flow [2023-11-19 07:39:15,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-11-19 07:39:15,658 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-11-19 07:39:15,659 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 66 flow [2023-11-19 07:39:15,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states 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:39:15,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:15,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:15,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:39:15,660 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:39:15,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:15,661 INFO L85 PathProgramCache]: Analyzing trace with hash -861397417, now seen corresponding path program 1 times [2023-11-19 07:39:15,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:15,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003821678] [2023-11-19 07:39:15,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:15,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:16,021 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:39:16,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:16,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003821678] [2023-11-19 07:39:16,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003821678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:16,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:16,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:39:16,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795759312] [2023-11-19 07:39:16,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:16,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:39:16,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:16,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:39:16,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:16,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 248 [2023-11-19 07:39:16,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states 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:39:16,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:16,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 248 [2023-11-19 07:39:16,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:17,301 INFO L124 PetriNetUnfolderBase]: 5813/8074 cut-off events. [2023-11-19 07:39:17,301 INFO L125 PetriNetUnfolderBase]: For 632/632 co-relation queries the response was YES. [2023-11-19 07:39:17,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17167 conditions, 8074 events. 5813/8074 cut-off events. For 632/632 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 40350 event pairs, 421 based on Foata normal form. 160/8234 useless extension candidates. Maximal degree in co-relation 17156. Up to 5505 conditions per place. [2023-11-19 07:39:17,379 INFO L140 encePairwiseOnDemand]: 240/248 looper letters, 53 selfloop transitions, 9 changer transitions 0/62 dead transitions. [2023-11-19 07:39:17,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 62 transitions, 280 flow [2023-11-19 07:39:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:17,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:39:17,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2023-11-19 07:39:17,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2023-11-19 07:39:17,387 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2023-11-19 07:39:17,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2023-11-19 07:39:17,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:17,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2023-11-19 07:39:17,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states 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:39:17,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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:39:17,395 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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:39:17,396 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 66 flow. Second operand 4 states and 512 transitions. [2023-11-19 07:39:17,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 62 transitions, 280 flow [2023-11-19 07:39:17,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 62 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:39:17,402 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 119 flow [2023-11-19 07:39:17,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-11-19 07:39:17,404 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-11-19 07:39:17,405 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 119 flow [2023-11-19 07:39:17,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states 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:39:17,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:17,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:17,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:39:17,407 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:39:17,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:17,408 INFO L85 PathProgramCache]: Analyzing trace with hash -933518281, now seen corresponding path program 1 times [2023-11-19 07:39:17,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:17,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182360608] [2023-11-19 07:39:17,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:17,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:17,751 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:39:17,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:17,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182360608] [2023-11-19 07:39:17,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182360608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:17,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:17,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:39:17,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457680791] [2023-11-19 07:39:17,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:17,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:39:17,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:17,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:39:17,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:17,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 248 [2023-11-19 07:39:17,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 119 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:39:17,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:17,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 248 [2023-11-19 07:39:17,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:19,082 INFO L124 PetriNetUnfolderBase]: 5175/7502 cut-off events. [2023-11-19 07:39:19,082 INFO L125 PetriNetUnfolderBase]: For 3396/3396 co-relation queries the response was YES. [2023-11-19 07:39:19,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19345 conditions, 7502 events. 5175/7502 cut-off events. For 3396/3396 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 39592 event pairs, 922 based on Foata normal form. 556/7953 useless extension candidates. Maximal degree in co-relation 19332. Up to 4945 conditions per place. [2023-11-19 07:39:19,138 INFO L140 encePairwiseOnDemand]: 241/248 looper letters, 77 selfloop transitions, 9 changer transitions 8/96 dead transitions. [2023-11-19 07:39:19,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 96 transitions, 537 flow [2023-11-19 07:39:19,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:39:19,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:39:19,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2023-11-19 07:39:19,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5056451612903226 [2023-11-19 07:39:19,143 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2023-11-19 07:39:19,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2023-11-19 07:39:19,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:19,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2023-11-19 07:39:19,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states 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:39:19,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states 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:39:19,152 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states 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:39:19,152 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 119 flow. Second operand 5 states and 627 transitions. [2023-11-19 07:39:19,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 96 transitions, 537 flow [2023-11-19 07:39:19,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 96 transitions, 537 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:39:19,160 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 188 flow [2023-11-19 07:39:19,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-11-19 07:39:19,162 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2023-11-19 07:39:19,163 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 188 flow [2023-11-19 07:39:19,163 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:39:19,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:19,164 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:39:19,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:39:19,164 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:39:19,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:19,165 INFO L85 PathProgramCache]: Analyzing trace with hash 154849655, now seen corresponding path program 1 times [2023-11-19 07:39:19,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:19,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026947300] [2023-11-19 07:39:19,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:19,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:19,462 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:39:19,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:19,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026947300] [2023-11-19 07:39:19,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026947300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:19,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:19,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:39:19,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925473818] [2023-11-19 07:39:19,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:19,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:39:19,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:19,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:39:19,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:19,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 248 [2023-11-19 07:39:19,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states 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:39:19,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:19,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 248 [2023-11-19 07:39:19,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:21,184 INFO L124 PetriNetUnfolderBase]: 6338/9241 cut-off events. [2023-11-19 07:39:21,185 INFO L125 PetriNetUnfolderBase]: For 8687/8687 co-relation queries the response was YES. [2023-11-19 07:39:21,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31073 conditions, 9241 events. 6338/9241 cut-off events. For 8687/8687 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 49873 event pairs, 1828 based on Foata normal form. 101/9342 useless extension candidates. Maximal degree in co-relation 31055. Up to 4710 conditions per place. [2023-11-19 07:39:21,260 INFO L140 encePairwiseOnDemand]: 242/248 looper letters, 60 selfloop transitions, 9 changer transitions 10/79 dead transitions. [2023-11-19 07:39:21,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 509 flow [2023-11-19 07:39:21,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:21,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:39:21,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 506 transitions. [2023-11-19 07:39:21,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5100806451612904 [2023-11-19 07:39:21,264 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 506 transitions. [2023-11-19 07:39:21,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 506 transitions. [2023-11-19 07:39:21,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:21,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 506 transitions. [2023-11-19 07:39:21,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states 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:39:21,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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:39:21,272 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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:39:21,273 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 188 flow. Second operand 4 states and 506 transitions. [2023-11-19 07:39:21,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 79 transitions, 509 flow [2023-11-19 07:39:21,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 79 transitions, 500 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:39:21,296 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 215 flow [2023-11-19 07:39:21,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-11-19 07:39:21,299 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2023-11-19 07:39:21,300 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 215 flow [2023-11-19 07:39:21,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states 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:39:21,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:21,302 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:39:21,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:39:21,302 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:39:21,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:21,303 INFO L85 PathProgramCache]: Analyzing trace with hash -790313905, now seen corresponding path program 1 times [2023-11-19 07:39:21,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:21,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192515860] [2023-11-19 07:39:21,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:21,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:21,637 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:39:21,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:21,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192515860] [2023-11-19 07:39:21,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192515860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:21,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:21,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:39:21,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459319479] [2023-11-19 07:39:21,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:21,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:39:21,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:21,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:39:21,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:39:21,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 248 [2023-11-19 07:39:21,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 215 flow. Second operand has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:21,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:21,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 248 [2023-11-19 07:39:21,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:22,589 INFO L124 PetriNetUnfolderBase]: 3657/5602 cut-off events. [2023-11-19 07:39:22,589 INFO L125 PetriNetUnfolderBase]: For 7129/7129 co-relation queries the response was YES. [2023-11-19 07:39:22,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19333 conditions, 5602 events. 3657/5602 cut-off events. For 7129/7129 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 30786 event pairs, 468 based on Foata normal form. 484/6029 useless extension candidates. Maximal degree in co-relation 19312. Up to 2195 conditions per place. [2023-11-19 07:39:22,639 INFO L140 encePairwiseOnDemand]: 241/248 looper letters, 74 selfloop transitions, 12 changer transitions 35/123 dead transitions. [2023-11-19 07:39:22,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 123 transitions, 883 flow [2023-11-19 07:39:22,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:39:22,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:39:22,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 755 transitions. [2023-11-19 07:39:22,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073924731182796 [2023-11-19 07:39:22,644 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 755 transitions. [2023-11-19 07:39:22,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 755 transitions. [2023-11-19 07:39:22,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:22,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 755 transitions. [2023-11-19 07:39:22,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states 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:39:22,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states 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:39:22,654 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states 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:39:22,654 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 215 flow. Second operand 6 states and 755 transitions. [2023-11-19 07:39:22,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 123 transitions, 883 flow [2023-11-19 07:39:22,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 123 transitions, 877 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-19 07:39:22,695 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 305 flow [2023-11-19 07:39:22,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-19 07:39:22,698 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2023-11-19 07:39:22,699 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 305 flow [2023-11-19 07:39:22,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:22,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:22,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:22,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:39:22,700 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:39:22,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:22,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1112901387, now seen corresponding path program 1 times [2023-11-19 07:39:22,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:22,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768886153] [2023-11-19 07:39:22,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:22,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:23,055 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:39:23,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:23,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768886153] [2023-11-19 07:39:23,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768886153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:23,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:23,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:39:23,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087216920] [2023-11-19 07:39:23,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:23,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:39:23,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:23,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:39:23,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:39:23,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 248 [2023-11-19 07:39:23,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 305 flow. Second operand has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states 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:39:23,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:23,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 248 [2023-11-19 07:39:23,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:23,991 INFO L124 PetriNetUnfolderBase]: 3017/4750 cut-off events. [2023-11-19 07:39:23,991 INFO L125 PetriNetUnfolderBase]: For 8931/8931 co-relation queries the response was YES. [2023-11-19 07:39:24,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19000 conditions, 4750 events. 3017/4750 cut-off events. For 8931/8931 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 26733 event pairs, 357 based on Foata normal form. 203/4907 useless extension candidates. Maximal degree in co-relation 18975. Up to 1820 conditions per place. [2023-11-19 07:39:24,033 INFO L140 encePairwiseOnDemand]: 241/248 looper letters, 84 selfloop transitions, 17 changer transitions 55/158 dead transitions. [2023-11-19 07:39:24,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 158 transitions, 1215 flow [2023-11-19 07:39:24,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:39:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 07:39:24,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1004 transitions. [2023-11-19 07:39:24,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5060483870967742 [2023-11-19 07:39:24,039 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1004 transitions. [2023-11-19 07:39:24,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1004 transitions. [2023-11-19 07:39:24,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:24,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1004 transitions. [2023-11-19 07:39:24,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.5) internal successors, (1004), 8 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states 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:39:24,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states 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:39:24,049 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states 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:39:24,050 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 305 flow. Second operand 8 states and 1004 transitions. [2023-11-19 07:39:24,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 158 transitions, 1215 flow [2023-11-19 07:39:24,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 158 transitions, 1169 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-11-19 07:39:24,255 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 372 flow [2023-11-19 07:39:24,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=372, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2023-11-19 07:39:24,256 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2023-11-19 07:39:24,256 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 372 flow [2023-11-19 07:39:24,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states 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:39:24,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:24,257 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, 1] [2023-11-19 07:39:24,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:39:24,257 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:39:24,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:24,258 INFO L85 PathProgramCache]: Analyzing trace with hash -569724880, now seen corresponding path program 1 times [2023-11-19 07:39:24,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:24,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636178181] [2023-11-19 07:39:24,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:24,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:24,663 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:39:24,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:24,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636178181] [2023-11-19 07:39:24,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636178181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:24,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:24,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:39:24,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913425696] [2023-11-19 07:39:24,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:24,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:39:24,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:24,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:39:24,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:39:24,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 248 [2023-11-19 07:39:24,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 372 flow. Second operand has 7 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 0 states have call successors, (0), 0 states 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:39:24,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:24,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 248 [2023-11-19 07:39:24,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:25,556 INFO L124 PetriNetUnfolderBase]: 2605/4155 cut-off events. [2023-11-19 07:39:25,557 INFO L125 PetriNetUnfolderBase]: For 8704/8704 co-relation queries the response was YES. [2023-11-19 07:39:25,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16674 conditions, 4155 events. 2605/4155 cut-off events. For 8704/8704 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 23727 event pairs, 337 based on Foata normal form. 40/4150 useless extension candidates. Maximal degree in co-relation 16646. Up to 1067 conditions per place. [2023-11-19 07:39:25,586 INFO L140 encePairwiseOnDemand]: 241/248 looper letters, 74 selfloop transitions, 21 changer transitions 51/148 dead transitions. [2023-11-19 07:39:25,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 148 transitions, 1170 flow [2023-11-19 07:39:25,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:39:25,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-19 07:39:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1223 transitions. [2023-11-19 07:39:25,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4931451612903226 [2023-11-19 07:39:25,593 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1223 transitions. [2023-11-19 07:39:25,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1223 transitions. [2023-11-19 07:39:25,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:25,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1223 transitions. [2023-11-19 07:39:25,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.3) internal successors, (1223), 10 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states 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:39:25,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 248.0) internal successors, (2728), 11 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states 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:39:25,607 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 248.0) internal successors, (2728), 11 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states 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:39:25,608 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 372 flow. Second operand 10 states and 1223 transitions. [2023-11-19 07:39:25,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 148 transitions, 1170 flow [2023-11-19 07:39:25,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 148 transitions, 1092 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-11-19 07:39:25,770 INFO L231 Difference]: Finished difference. Result has 68 places, 48 transitions, 341 flow [2023-11-19 07:39:25,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=341, PETRI_PLACES=68, PETRI_TRANSITIONS=48} [2023-11-19 07:39:25,771 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2023-11-19 07:39:25,771 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 341 flow [2023-11-19 07:39:25,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 0 states have call successors, (0), 0 states 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:39:25,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:25,772 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, 1, 1, 1, 1] [2023-11-19 07:39:25,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:39:25,773 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:39:25,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:25,774 INFO L85 PathProgramCache]: Analyzing trace with hash -828950445, now seen corresponding path program 1 times [2023-11-19 07:39:25,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:25,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125867324] [2023-11-19 07:39:25,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:25,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:26,124 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:39:26,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:26,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125867324] [2023-11-19 07:39:26,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125867324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:26,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:26,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:39:26,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720891325] [2023-11-19 07:39:26,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:26,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:39:26,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:26,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:39:26,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:26,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 248 [2023-11-19 07:39:26,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 341 flow. Second operand has 4 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:39:26,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:26,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 248 [2023-11-19 07:39:26,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:26,542 INFO L124 PetriNetUnfolderBase]: 1461/2335 cut-off events. [2023-11-19 07:39:26,543 INFO L125 PetriNetUnfolderBase]: For 5044/5044 co-relation queries the response was YES. [2023-11-19 07:39:26,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9730 conditions, 2335 events. 1461/2335 cut-off events. For 5044/5044 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11569 event pairs, 296 based on Foata normal form. 1/2336 useless extension candidates. Maximal degree in co-relation 9702. Up to 1524 conditions per place. [2023-11-19 07:39:26,557 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 47 selfloop transitions, 1 changer transitions 51/99 dead transitions. [2023-11-19 07:39:26,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 99 transitions, 906 flow [2023-11-19 07:39:26,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:26,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:39:26,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 521 transitions. [2023-11-19 07:39:26,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5252016129032258 [2023-11-19 07:39:26,560 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 521 transitions. [2023-11-19 07:39:26,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 521 transitions. [2023-11-19 07:39:26,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:26,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 521 transitions. [2023-11-19 07:39:26,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states 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:39:26,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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:39:26,566 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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:39:26,566 INFO L175 Difference]: Start difference. First operand has 68 places, 48 transitions, 341 flow. Second operand 4 states and 521 transitions. [2023-11-19 07:39:26,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 99 transitions, 906 flow [2023-11-19 07:39:26,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 99 transitions, 708 flow, removed 52 selfloop flow, removed 11 redundant places. [2023-11-19 07:39:26,605 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 205 flow [2023-11-19 07:39:26,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=205, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2023-11-19 07:39:26,605 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2023-11-19 07:39:26,606 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 205 flow [2023-11-19 07:39:26,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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:39:26,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:26,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:26,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:39:26,606 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:39:26,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:26,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1772718545, now seen corresponding path program 2 times [2023-11-19 07:39:26,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:26,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986714055] [2023-11-19 07:39:26,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:26,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:26,871 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:39:26,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:26,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986714055] [2023-11-19 07:39:26,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986714055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:26,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:26,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:39:26,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770955392] [2023-11-19 07:39:26,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:26,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:39:26,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:26,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:39:26,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:26,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 248 [2023-11-19 07:39:26,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 41 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:26,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:26,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 248 [2023-11-19 07:39:26,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:27,108 INFO L124 PetriNetUnfolderBase]: 475/808 cut-off events. [2023-11-19 07:39:27,108 INFO L125 PetriNetUnfolderBase]: For 1088/1089 co-relation queries the response was YES. [2023-11-19 07:39:27,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2893 conditions, 808 events. 475/808 cut-off events. For 1088/1089 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3277 event pairs, 126 based on Foata normal form. 2/810 useless extension candidates. Maximal degree in co-relation 2875. Up to 485 conditions per place. [2023-11-19 07:39:27,113 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 45 selfloop transitions, 1 changer transitions 36/83 dead transitions. [2023-11-19 07:39:27,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 83 transitions, 586 flow [2023-11-19 07:39:27,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:27,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:39:27,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2023-11-19 07:39:27,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5211693548387096 [2023-11-19 07:39:27,116 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 517 transitions. [2023-11-19 07:39:27,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 517 transitions. [2023-11-19 07:39:27,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:27,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 517 transitions. [2023-11-19 07:39:27,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states 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:39:27,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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:39:27,121 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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:39:27,122 INFO L175 Difference]: Start difference. First operand has 60 places, 41 transitions, 205 flow. Second operand 4 states and 517 transitions. [2023-11-19 07:39:27,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 83 transitions, 586 flow [2023-11-19 07:39:27,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 83 transitions, 570 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-11-19 07:39:27,130 INFO L231 Difference]: Finished difference. Result has 55 places, 37 transitions, 181 flow [2023-11-19 07:39:27,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=55, PETRI_TRANSITIONS=37} [2023-11-19 07:39:27,131 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2023-11-19 07:39:27,131 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 37 transitions, 181 flow [2023-11-19 07:39:27,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:27,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:27,132 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, 1, 1, 1, 1] [2023-11-19 07:39:27,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:39:27,132 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:39:27,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:27,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1885918571, now seen corresponding path program 3 times [2023-11-19 07:39:27,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:27,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185088686] [2023-11-19 07:39:27,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:27,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:39:27,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:39:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:39:27,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:39:27,283 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:39:27,284 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-19 07:39:27,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-19 07:39:27,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-19 07:39:27,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-19 07:39:27,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-19 07:39:27,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-19 07:39:27,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-19 07:39:27,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:39:27,288 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:27,295 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:39:27,296 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:39:27,358 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:39:27,360 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:39:27,361 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-19 07:39:27,363 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated [2023-11-19 07:39:27,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:39:27 BasicIcfg [2023-11-19 07:39:27,408 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:39:27,408 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:39:27,409 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:39:27,409 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:39:27,409 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:06" (3/4) ... [2023-11-19 07:39:27,410 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 07:39:27,470 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:39:27,471 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:39:27,472 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-19 07:39:27,473 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated [2023-11-19 07:39:27,594 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7824235d-92b1-43b7-a1e6-864e2477beaa/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:39:27,594 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:39:27,595 INFO L158 Benchmark]: Toolchain (without parser) took 22766.70ms. Allocated memory was 140.5MB in the beginning and 903.9MB in the end (delta: 763.4MB). Free memory was 91.5MB in the beginning and 765.4MB in the end (delta: -673.9MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. [2023-11-19 07:39:27,595 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 109.1MB. Free memory is still 59.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:39:27,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 743.91ms. Allocated memory is still 140.5MB. Free memory was 91.5MB in the beginning and 67.2MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-19 07:39:27,596 INFO L158 Benchmark]: Boogie Procedure Inliner took 138.59ms. Allocated memory is still 140.5MB. Free memory was 67.2MB in the beginning and 109.1MB in the end (delta: -41.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2023-11-19 07:39:27,597 INFO L158 Benchmark]: Boogie Preprocessor took 46.12ms. Allocated memory is still 140.5MB. Free memory was 109.1MB in the beginning and 107.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:39:27,597 INFO L158 Benchmark]: RCFGBuilder took 922.60ms. Allocated memory is still 140.5MB. Free memory was 107.1MB in the beginning and 67.1MB in the end (delta: 40.0MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2023-11-19 07:39:27,597 INFO L158 Benchmark]: TraceAbstraction took 20721.08ms. Allocated memory was 140.5MB in the beginning and 903.9MB in the end (delta: 763.4MB). Free memory was 66.5MB in the beginning and 782.2MB in the end (delta: -715.7MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2023-11-19 07:39:27,598 INFO L158 Benchmark]: Witness Printer took 186.06ms. Allocated memory is still 903.9MB. Free memory was 782.2MB in the beginning and 765.4MB in the end (delta: 16.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 07:39:27,600 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.60ms. Allocated memory is still 109.1MB. Free memory is still 59.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 743.91ms. Allocated memory is still 140.5MB. Free memory was 91.5MB in the beginning and 67.2MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 138.59ms. Allocated memory is still 140.5MB. Free memory was 67.2MB in the beginning and 109.1MB in the end (delta: -41.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.12ms. Allocated memory is still 140.5MB. Free memory was 109.1MB in the beginning and 107.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 922.60ms. Allocated memory is still 140.5MB. Free memory was 107.1MB in the beginning and 67.1MB in the end (delta: 40.0MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20721.08ms. Allocated memory was 140.5MB in the beginning and 903.9MB in the end (delta: 763.4MB). Free memory was 66.5MB in the beginning and 782.2MB in the end (delta: -715.7MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. * Witness Printer took 186.06ms. Allocated memory is still 903.9MB. Free memory was 782.2MB in the beginning and 765.4MB in the end (delta: 16.8MB). 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~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 141 PlacesBefore, 40 PlacesAfterwards, 130 TransitionsBefore, 28 TransitionsAfterwards, 3360 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 114 TotalNumberOfCompositions, 7364 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3705, independent: 3503, independent conditional: 0, independent unconditional: 3503, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1851, independent: 1805, independent conditional: 0, independent unconditional: 1805, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3705, independent: 1698, independent conditional: 0, independent unconditional: 1698, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 1851, unknown conditional: 0, unknown unconditional: 1851] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 107, Positive conditional cache size: 0, Positive unconditional cache size: 107, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t469; [L865] FCALL, FORK 0 pthread_create(&t469, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t469={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L866] 0 pthread_t t470; [L867] FCALL, FORK 0 pthread_create(&t470, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t469={5:0}, t470={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L868] 0 pthread_t t471; [L869] FCALL, FORK 0 pthread_create(&t471, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L870] 0 pthread_t t472; [L871] FCALL, FORK 0 pthread_create(&t472, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 z$flush_delayed = weak$$choice2 [L826] 4 z$mem_tmp = z [L827] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L828] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L829] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L830] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L831] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L833] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = z [L835] 4 z = z$flush_delayed ? z$mem_tmp : z [L836] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L839] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L842] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L843] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L844] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L845] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L846] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L878] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L879] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L880] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L881] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L886] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 871]: 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: 865]: 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: 869]: 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: 867]: 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 9 procedures, 171 locations, 7 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.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 535 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 461 mSDsluCounter, 101 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1076 IncrementalHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 45 mSDtfsCounter, 1076 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=372occurred in iteration=7, InterpolantAutomatonStates: 51, 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, 3.0s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 532 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:39:27,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7824235d-92b1-43b7-a1e6-864e2477beaa/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